#include <iostream>
#include <cmath>
using namespace std;
int main() {
int mod = pow(10, 9) + 7;
int n = 0, x = 0, y = 0;
cin >> n;
x = y = 1;
int tmp = 0;
for (int i = 0 ; i < n - 2 ; ++i) {
tmp = x + y;
x = y;
y = tmp;
if (tmp > mod) {
x %= mod;
y %= mod;
tmp %= mod;
}
}
if (n == 1 || n == 2) {
cout << 1;
}
else {
cout << tmp % mod;
}
return 0;
}
// 开始以为要用长整型ll,后来发现不用,int最大2e10(2147283647),这里只有1e9
// 溢出前取模是技巧