#include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define debug(v)          \
    cout << #v << ":";    \
    for (auto x : v)      \
    {                     \
        cout << x << ' '; \
    }                     \
    cout << endl;
#define INF 1000000000
#define mod 1000000007
using ll = long long;
const ll LINF = 1001002003004005006ll;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return true;
    }
    return false;
}

//n!
ll fact_mod(ll n)
{
    ll ret = 1;
    for (ll i = 2; i <= n; i++)
        ret = ret * (i % mod) % mod;
    return ret;
}

// 繰り返し二乗法
ll pow_mod(ll x, ll n)
{
    if (n == 0)
        return 1;
    ll ret = pow_mod((x * x) % mod, n / 2);
    if (n & 1)
        ret = (ret * x) % mod;
    return ret;
}

//nCr O(r) nがでかくても安心
ll combination_mod(ll n, ll r)
{
    if (r > n - r)
        r = n - r;
    if (r == 0)
        return 1;
    ll a = 1;
    //a=n!/(n-r)!=n~n-r+1までの総積->O(r)
    for (ll i = 0; i < r; i++)
        a = a * ((n - i) % mod) % mod;
    //b=inv(r!)
    ll b = pow_mod(fact_mod(r), mod - 2);
    return (a % mod) * (b % mod) % mod;
}

ll inv_mod(ll n)
{
    // フェルマーの小定理
    return pow_mod(n, mod - 2);
}

template <class T>
vector<vector<T>> matplus(vector<vector<T>> a, vector<vector<T>> b)
{
    asert(a.size() == b.size() and a[0].size() == b[0].size());
    for (int i = 0; i < a.size(); i++)
    {
        for (int j = 0; j < a[0].size(); j++)
        {
            a[i][j] += b[i][j];
        }
    }
    return a;
}

template <class T>
vector<vector<T>> matminus(vector<vector<T>> a, vector<vector<T>> b)
{
    asert(a.size() == b.size() and a[0].size() == b[0].size());
    for (int i = 0; i < a.size(); i++)
    {
        for (int j = 0; j < a[0].size(); j++)
        {
            a[i][j] -= b[i][j];
        }
    }
    return a;
}

template <class T>
vector<vector<T>> matmul(vector<vector<T>> a, vector<vector<T>> b)
{
    assert(a[0].size() == b.size());
    int n = b.size();
    vector<vector<T>> ret(a.size(), vector<T>(b[0].size(), 0));
    for (int i = 0; i < a.size(); i++)
    {
        for (int j = 0; j < b[0].size(); j++)
        {
            for (int k = 0; k < n; k++)
            {
                ret[i][j] += a[i][k] * b[k][j];
            }
        }
    }
    return ret;
}

template <class T>
vector<vector<T>> matpow(vector<vector<T>> a, ll k)
{
    assert(a.size() == a[0].size());
    int n = a.size();
    vector<vector<T>> ret(n, vector<T>(n, 0));
    for (int i = 0; i < n; i++)
        ret[i][i] = 1;
    while (k > 0)
    {
        if (k & 1)
            ret = matmul(ret, a);
        a = matmul(a, a);
        k >>= 1;
    }
    return ret;
}

//mod
vector<vector<ll>> matplus_mod(vector<vector<ll>> a, vector<vector<ll>> b)
{
    assert(a.size() == b.size() and a[0].size() == b[0].size());
    for (int i = 0; i < a.size(); i++)
    {
        for (int j = 0; j < a[0].size(); j++)
        {
            a[i][j] += b[i][j];
            if (a[i][j] >= mod)
                a[i][j] -= mod;
        }
    }
    return a;
}

vector<vector<ll>> matminus_mod(vector<vector<ll>> a, vector<vector<ll>> b)
{
    assert(a.size() == b.size() and a[0].size() == b[0].size());
    for (int i = 0; i < a.size(); i++)
    {
        for (int j = 0; j < a[0].size(); j++)
        {
            a[i][j] -= b[i][j];
            if (a[i][j] < 0)
                a[i][j] += mod;
        }
    }
    return a;
}

vector<vector<ll>> matmul_mod(vector<vector<ll>> a, vector<vector<ll>> b)
{
    assert(a[0].size() == b.size());
    int n = b.size();
    vector<vector<ll>> ret(a.size(), vector<ll>(b[0].size(), 0));
    for (int i = 0; i < a.size(); i++)
    {
        for (int j = 0; j < b[0].size(); j++)
        {
            for (int k = 0; k < n; k++)
            {
                ret[i][j] += a[i][k] * b[k][j] % mod;
                ret[i][j] %= mod;
            }
        }
    }
    return ret;
}

vector<vector<ll>> matpow_mod(vector<vector<ll>> a, ll k)
{
    assert(a.size() == a[0].size());
    int n = a.size();
    vector<vector<ll>> ret(n, vector<ll>(n, 0));
    for (int i = 0; i < n; i++)
        ret[i][i] = 1;
    while (k > 0)
    {
        if (k & 1)
            ret = matmul_mod(ret, a);
        a = matmul_mod(a, a);
        k >>= 1;
    }
    return ret;
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(0);

    ll n;
    cin >> n;
    vector<vector<ll>> mat(2, vector<ll>(2));
    mat[0][0] = 1;
    mat[0][1] = 1;
    mat[1][0] = 1;
    mat[1][1] = 0;
    mat = matpow_mod(mat, n);
    vector<vector<ll>> w(1, vector<ll>(2));
    w[0][0]=1;
    w[0][1]=0;
    w = matmul_mod(w, mat);
    cout << w[0][0]*w[0][1]%mod << endl;
}