fibo_re.cpp

#include<bits/stdc++.h>
using namespace std;

int recursion(int a)
{
    return a*a;
}
int main()
{
    int input,n,i,j,arr[100] = {0,1};
    cin>>input;
    n=recursion(input);
    if(input*input == n)
        recursion(n);
    cout<<n;
    return 0;


}