#include<bits/stdc++.h>
typedef uint64_t u64;
typedef int64_t i64;
using namespace std;

template<u64 mod> struct modint{
  u64 val;
  modint(i64 val_=0):val((val_%i64(mod)+i64(mod))%i64(mod)){}
  modint operator-(){
    return (val==0)?0:mod-val;
  }
  modint operator+(modint rhs){
    return modint(*this)+=rhs;
  }
  modint operator-(modint rhs){
    return modint(*this)-=rhs;
  }
  modint operator*(modint rhs){
    return modint(*this)*=rhs;
  }
  modint operator/(modint rhs){
    return modint(*this)/=rhs;
  }
  modint pow(i64 rhs){
    modint res=1,now=(*this);
    while(rhs){
      res*=((rhs&1)?now:1),now*=now,rhs>>=1;
    }
    return res;
  }
  modint &operator+=(modint rhs){
    val+=rhs.val,val-=((val>=mod)?mod:0);
    return (*this);
  }
  modint &operator-=(modint rhs){
    val+=((val<rhs.val)?mod:0),val-=rhs.val;
    return (*this);
  }
  modint &operator*=(modint rhs){
    val=val*rhs.val%mod;
    return (*this);
  }
  modint &operator/=(modint rhs){
    return (*this)*=rhs.pow(mod-2);
  }
  bool operator==(modint rhs){
    return val==rhs.val;
  }
  bool operator!=(modint rhs){
    return val!=rhs.val;
  }
  friend std::ostream &operator<<(std::ostream& os,modint x){
    return os<<(x.val);
  }
  friend std::istream &operator>>(std::istream& is,modint& x){
    u64 t;
    is>>t,x=t;
    return is;
  }
};

vector<vector<modint<1000000007>>> t;

template<typename T> vector<T> conv(vector<T> f,vector<T> g){
  vector<T> res(f.size()+g.size()-1);
  for(size_t i=0;i<f.size();++i){
    for(size_t j=0;j<g.size();++j){
      res[i+j]+=f[i]*g[j];
    }
  }
  return res;
}

template<typename T> void E(vector<T>& f){
  for(int i=0;i<(f.size()+1)/2;++i){
    f[i]=f[i*2];
  }
  f.resize((f.size()+1)/2);
}

template<typename T> void O(vector<T>& f){
  for(int i=0;i<f.size()/2;++i){
    f[i]=f[i*2+1];
  }
  f.resize(f.size()/2);
}

template<typename T> vector<T> M(vector<T> f){
  for(int i=1;i<f.size();i+=2){
    f[i]*=-1;
  }
  return f;
}

template<typename T> T bostan_mori(vector<T> f,vector<T> g,i64 k){
  if(k<0){
    return 0;
  }
  int now=0;
  while(k>0){
    auto h=M(g);
    f=conv(f,h);
    if(t.size()<=now){
      g=conv(g,h);
      E(g);
      t.emplace_back(g);
      now++;
    }
    else{
      g=t[now];
      now++;
    }
    if(k%2==0){
      E(f);
    }
    else{
      O(f);
    }
    k/=2;
  }
  return f[0];
}

int main(){
  constexpr u64 mod=1000000007;
  typedef modint<mod> mint;
  vector<mint> f={1};
  vector<mint> g={1,-1,-1};
  vector<mint> h={1,-2,-1,2,1};
  i64 n;
  cin>>n;
  if(n%2==0){
    cout<<bostan_mori(f,g,n/2)<<endl;
  }
  else{
    cout<<bostan_mori(f,h,(n-1)/2)+bostan_mori(f,h,(n-3)/2)<<endl;
  }
}