Data structure program to raise 2 to the power of n

/* raising 2 to the power of n */
void main()
{
int pow(int);
int n,p;
clrscr();
printf("\n\n\t\tFINDING 2^N\n\n");
printf("\t\tEnter the Number : ");
scanf("%d",&n);
p=pow(n);
printf("\n\tpow(2,%d) = %d ",n,p);
getch();
}
int pow(int n)
{
if(n==0)
return 1;
else
return(pow(n-1)+pow(n-1));
}