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

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	int n;
	cin >> n;
	vector<int>a(n+1);
	const int mod = 1000007;
	a[0] = a[1] = a[2] = 1;
	for(int i = 3; i<=n; i++){
		a[i] = a[i-1] + a[i-2];
		a[i]%=mod;
	}
	cout << a[n] << '\n';
	return 0;
}