#include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll fib(ll n) {
if (n == 0) return 0;
ll a = 0, b = 1;
for (ll i = 2; i <= n; ++i) {
ll temp = (a + b) % MOD;
a = b;
b = temp;
}
return b;
}
int main() {
ll n;
cin >> n;
cout << fib(n) << endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwp0eXBlZGVmIGxvbmcgbG9uZyBsbDsKCmNvbnN0IGxsIE1PRCA9IDFlOSArIDc7CgpsbCBmaWIobGwgbikgewogICAgaWYgKG4gPT0gMCkgcmV0dXJuIDA7CiAgICBsbCBhID0gMCwgYiA9IDE7CiAgICBmb3IgKGxsIGkgPSAyOyBpIDw9IG47ICsraSkgewogICAgICAgIGxsIHRlbXAgPSAoYSArIGIpICUgTU9EOwogICAgICAgIGEgPSBiOwogICAgICAgIGIgPSB0ZW1wOwogICAgfQogICAgcmV0dXJuIGI7Cn0KCmludCBtYWluKCkgewogICAgbGwgbjsKICAgIGNpbiA+PiBuOwogICAgY291dCA8PCBmaWIobikgPDwgZW5kbDsKICAgIHJldHVybiAwOwp9Cg==