public class RecursionFibonacci
{

   public static void main(String[] args)
   {
      System.out.println(fib(8));      // 21
      // 8th term of the Fibonacci sequence is 21
      // 1, 1, 2, 3, 5, 8, 13, 21
   }

   public static int fib(int n)
   {
   
      if (n == 1 || n == 2)
      {
         return 1;
      }
      else
      {
         return fib(n - 1) + fib(n - 2);
      }

   }
   
}