int Fibona ( int  n )
 { /*求第n項(xiàng)Fibonacci級(jí)數(shù)的值*/
   int  m;
   if  (n==1)  return (1);
   else if (n==2) return(1);
      else
        {  m=Fibona(n-1)+ Fibona(n-2);
           return (m);
          }
  }
main()
{  int n,a;
   scanf("%d",&n);
   a=Fibona(n);
   printf("the fibonacci value is %d",a);
}