P1962-矩阵快速幂板子

#include<bits/stdc++.h>
#define int long long
using namespace std;
int read(){
	int f=1,re=0;char ch;
	for(ch=getchar();!isdigit(ch)&&ch!='-';ch=getchar());
	if(ch=='-'){f=-1,ch=getchar();}
	for(;isdigit(ch);ch=getchar()) re=(re<<3)+(re<<1)+ch-'0';
	return re*f;
}
int n;
const int mod=1e9+7; 
struct Matrix{
	int a[3][3];
	Matrix(){memset(a,0,sizeof(a));}
	Matrix operator*(const Matrix &b)const{
		Matrix res;
		for(int i=1;i<=2;i++)
			for(int j=1;j<=2;j++)
				for(int k=1;k<=2;k++)
					res.a[i][j]=(res.a[i][j]+a[i][k]*b.a[k][j]%mod)%mod;
		return res;
	}
}base,ans;
void init(){
	base.a[1][1]=base.a[1][2]=base.a[2][1]=1;
	ans.a[1][1]=ans.a[2][1]=1;
}
int ksm(int b){
	while(b){
		if(b&1) ans=base*ans;
		base=base*base;
		b>>=1;
	}return ans.a[1][1]%mod;
}
signed main(){
	n=read();init();
	if(n<=2) printf("1\n");
	else printf("%lld\n",ksm(n-2)%mod);
	return 0;
}