求助！！

结果：https://www.luogu.com.cn/record/120338896

#include<iostream>
using namespace std;
typedef long long ll;
//这还快速幂呢，还有3个TLE
ll fast_pow(ll n,ll m) 
{
	ll ds=n;
	ll zs=m;
	ll ew=1;
	while(zs!=0)
	{
		if(zs&1!=0)
		{
			ew=ew*ds;
		}
		zs=zs>>1;
		ds=ds*ds;
	}
	return ew;
}

ll fibonacci(ll n)
{
	ll jg;
	if(n==1||n==2)
	{
		jg=1;		
	}else{
		jg=fibonacci(n-2)+fibonacci(n-1);
	}
	return jg;
}

int main()
{
	ll n;
	cin>>n;
	cout<< fibonacci(n) % (fast_pow(10,9)+7)<<endl;
	return 0;
}