// includes #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include // macros #define ll long long int #define pb emplace_back #define mk make_pair #define pq priority_queue #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define rep(i, n) FOR(i, 0, n) #define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--) #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) using namespace std; // types typedef pair P; typedef pair Pl; typedef pair Pll; typedef pair Pd; // constants const int inf = 1e9; const ll linf = 1LL << 50; const double EPS = 1e-10; const int mod = 1e9 + 7; // solve template bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;} template bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;} using vv = vector >; vv operator*(const vv &x, const vv &y){ vv res(x.size(), vector(x.size(), 0)); for(int i = 0; i < sz(x); i++){ for(int j = 0; j < sz(x); j++){ for(int k = 0; k < sz(x); k++){ res[i][j] = (res[i][j] + x[i][k] * y[k][j] % mod) % mod; } } } return res; } vector > power(vector > v, ll n){ vector > res(2, vector(2, 0)), curr = v; res[0][0] = 1, res[1][1] = 1; ll tmp = n; while(tmp){ if(tmp % 2 == 1){ res = res * curr; } curr = curr * curr; tmp /= 2; } return res; } int main(int argc, char const* argv[]) { ios_base::sync_with_stdio(false); cin.tie(0); ll n; cin >> n; vector > v = {{1, 1}, {1, 0}}; auto vn = power(v, n); ll fn1 = vn[0][0]; ll fn = vn[1][0]; cout << fn * fn1 % mod << endl; return 0; }