#include<bits/stdc++.h>
using namespace std;
#define int long long
int MOD=1000000007LL;
typedef vector<int> arr;
typedef vector<arr> mat;
inline arr mul(mat a,arr& b,int mod){
  arr res(b.size(),0);
  for(int i=0;i<(int)b.size();i++)
    for(int j=0;j<(int)a[i].size();j++)
      (res[i]+=a[i][j]*b[j])%=mod;
  return res;
}
inline mat mul(mat a,mat& b,int mod){
  mat res(a.size(),arr(b[0].size(),0));
  for(int i=0;i<(int)a.size();i++)
    for(int j=0;j<(int)b[0].size();j++)
      for(int k=0;k<(int)b.size();k++)
	(res[i][j]+=a[i][k]*b[k][j])%=mod;
  return res;
}
mat base;
inline mat mat_pow(mat a,int n,int mod){
  mat res(base);
  while(n){
    if(n&1) res=mul(a,res,mod);
    a=mul(a,a,mod);
    n>>=1;
  }
  return res;
}

typedef pair<int,int> P;
signed main(){
  mat A(2,arr(2,1));
  mat B(2,arr(1,0));
  A[1][1]=0;
  B[0][0]=1;
  base = mat(2,arr(2,0));
  base[0][0]=base[1][1]=1;
  int n;
  cin>>n;
  int fib1=(mul(mat_pow(A,n,2*(MOD+1)),B,2*(MOD+1)))[1][0];
  int fib2=(mul(mat_pow(A,fib1,MOD),B,MOD))[1][0];
  cout<<fib2<<endl;
  return 0;
}