#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

// https://oeis.org/A080041

typedef vector<vl> mat;

mat mul(const mat &a, const mat &b){
  mat ret(2,vl(2));
  REP(k,2)REP(i,2)REP(j,2)ret[i][j]+=a[i][k]*b[k][j];
  REP(i,2)REP(j,2)ret[i][j] %= 1000;
  return ret;
}

int main(){
  ll n;
  cin>>n;
  if(n==0){
    cout<<1<<endl;
  }else if(n==1){
    cout<<2<<endl;
  }else if(n==2){
    cout<<7<<endl;
  }else{
    mat I(2,vl(2));
    I[0][0] = I[1][1] = 1;
    mat X(2,vl(2));
    X[0][0] = X[0][1] = 2;
    X[1][0] = 1;
    mat ret = I;
    ll t = n-1;
    while(t){
      if(t&1) ret=mul(ret,X);
      X=mul(X,X);
      t>>=1;
    }
    ll a_n = (ret[0][0]*2 + ret[0][1]*2)%1000;
    if(n%2==0) --a_n;
    cout<<a_n<<endl;
  }
  return 0;
}