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

typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
template<class T>bool chmin(T&a,const T&b){return a>b?(a=b,true):false;}
template<class T>bool chmax(T&a,const T&b){return a<b?(a=b,true):false;}

typedef vector<ll> Array;
typedef vector<Array> Matrix;

Matrix zero(int n){ return Matrix(n, Array(n)); }

Matrix identity(int n) {
  Matrix A = zero(n);
  REP(i,n) A[i][i] = 1;
  return A;
}

Matrix mul(const Matrix &A, const Matrix& B, ll mod) {
  Matrix C( A.size(), Array(B[0].size() ) );
  REP(i, C.size()) REP(j, C[i].size()) REP(k, A[i].size()) {
      C[i][j] += A[i][k] * B[k][j];
      if (C[i][j] >= mod) C[i][j] %= mod;
  }
  return C;
}

Matrix pow(Matrix A, ll b, ll mod) {
  Matrix C = identity(A.size());
  while (b > 0) {
      if ((b & 1) == 1) C = mul(C, A, mod);
      A = mul(A, A, mod);
      b >>= 1;
  }
  return C;
}


ll f(ll n, ll mod) {
  Matrix A = zero(2);
  A[0][0] = 1;
  A[0][1] = 1;
  A[1][0] = 1;
  Matrix An = pow(A, n, mod);
  return An[0][1];
}

int main2() {
  ll N;
  cin >> N;
  cout << f(f(N, 2000000016LL), 1000000007LL) << endl;
  return 0;
}

int main() {
  for (;!cin.eof();cin>>ws) main2();
  return 0;
}