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

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

LL n, MOD1 = 2e9 + 16, MOD2 = 1e9 + 7;

void mat_prod(LL a[2][2], LL b[2][2], LL c[2][2], LL MOD) { // a = b * c;
	LL d[2][2];
	inc(i, 2) {
	inc(j, 2) {
		d[i][j] = 0;
	}
	}
	
	inc(i, 2) {
	inc(j, 2) {
	inc(k, 2) {
		(d[i][j] += b[i][k] * c[k][j]) %= MOD;
	}
	}
	}
	
	inc(i, 2) {
	inc(j, 2) {
		a[i][j] = d[i][j];
	}
	}
	
	return;
}

void mat_exp(LL a[2][2], LL b[2][2], LL c, LL MOD) { // a = b ^ c;
	LL t[60][2][2];
	inc(i, 2) {
	inc(j, 2) {
		t[0][i][j] = b[i][j];
	}
	}
	inc(i, 60 - 1) {
		mat_prod(t[i + 1], t[i], t[i], MOD);
	}
	
	inc(i, 2) {
	inc(j, 2) {
		a[i][j] = 0;
	}
	}
	inc(i, 2) { a[i][i] = 1; }
	inc(i, 60) {
		if((c >> i) % 2 == 1) {
			mat_prod(a, a, t[i], MOD);
		}
	}
	
	return;
}

LL b[2][2];
void p() {
	inc(i, 2) {
	inc(j, 2) {
		cout << b[i][j] << " ";
	} cout << endl;
	} cout << endl;
}

int main() {
	cin >> n;
	/*
	int a = 0, b = 1, c, i = 0;
	while(true) {
		c = (a + b) % MOD;
		a = b;
		b = c;
		i++;
		if(i % 10000000 == 0) { cout << i << ": " << a << " " << b << endl; }
		if(a == 0 && b == 1) { break; }
	}
	// 2e9 + 16
	*/
	
	LL a[2][2] = { { 1, 1 }, { 1, 0 } };
	//
	mat_exp(b, a,       n, MOD1); // p();
	mat_exp(b, a, b[1][0], MOD2); // p();
	
	cout << b[1][0] << endl;
	
	return 0;
}