Find the power of a number using recursion

#include<stdio.h>

int main() {
int pow, num;
long int res;
long int power(int, int);

printf("Enter a number: ");
scanf("%d", &num);

printf("Enter power: ");
scanf("%d", &pow);

res = power(num, pow);
printf("%d to the power %d is: %ld", num, pow, res);

getch();
return 0;
}

int i = 1;
long int sum = 1;
long int power (int n, int p) {
if(p == 0)
return 1;
if(p%2 == 0)
return power(n*n, p/2);

return power(n*n, p/2) * n;
}