// yukicoder My Practice
// author: Leonardone @ NEETSDKASU
#include <cstdio>

using namespace std;

typedef long long ll;

const ll MD = 1000000007LL;

// 解説読後
// http://yukicoder.me/problems/882/editorial

#define arrlen(x) (sizeof(x) / sizeof((x)[0]))

char str[100];
ll a[1000005] = {0, 1, 0};
ll *an = a + 3, *an2 = a + 1, *an3 = a, *end = a + 1000004; 

int main() {
    
    while (an != end) {
        *an++ = (*an2++ + *an3++) % MD;
    }
    
    int n = 0;
    int k = fread(str, sizeof(char), arrlen(str), stdin);
    char *p = str;
    while (*p) {
        n = (n * 10) + int(*p++ - '0');
    }
    
    ll r = a[n + 4], t;
    
    p = str + 99;
    while (r) {
        t = r / 10LL;
        *(--p) = '0' + char(r - 10LL * t);
        r = t;
    }
    
    fwrite(p, sizeof(char), str + 99 - p, stdout);
    
    return 0;
}