#include <bits/stdc++.h>
using namespace std;
long long ans[100][100];
long long len = 1,N=1000000007;
void fei(long long a) {
	for (long long i = 0; i < len; i++) {
		ans[a][i] = ans[a - 1][i] + ans[a - 2][i];
	}
	for (long long i = 0; i < len; i++) {
		if (ans[a][i] >= 10) {
			ans[a][i] %= 10;
			ans[a][i + 1]++;
			if (ans[a][len] != 0)len++;
		}
	}
}
int main() {
	long long n;
	cin >> n;
	ans[0][0] = 1;
	ans[1][0] = 1;
	for (long long i = 2; i < n; i++) {
		fei(i);
	}
	long long x=0,k=0;
	for (long long i = 0; i <= len - 1; i++) {
		x+=pow(10,k)*ans[n-1][i];
		k++;
	}
	cout<<x%N;
	return 0;
}
### 怎么办？？