int fac(int n)
{
/*if (n <= 1)
return 1;
else
return n * fac(n - 1);*/ //if 语句
/*int i = 0;
int ret = 1;
for (int i = 1; i <= n; i++)
{
ret *= i;
}
return ret;*/ //迭代的方式(非递归)
}
int main()
{
int n = 0;
scanf("%d", &n);
int ret = fac(n);
printf("ret = %d\n",ret);
return 0;
}