#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<n; ++i)
#define repl(i,m,n) for(ll i=m; i<n; ++i)

vector<int> pow2017(5000, -1);

int powmod(int ex, int mod){
    if(pow2017[ex] != -1) return pow2017[ex];
    else{
        if(ex == 0) return pow2017[0] = 1;
        else if(ex % 2 == 0) return pow2017[ex] = (powmod(ex/2, mod)*powmod(ex/2, mod)) % mod;
        else return pow2017[ex] = (2017*powmod(ex-1, mod)) % mod;
    }
}

int main(){
    int M;
    cin >> M;

    ll X = powmod(2017*2, M);
    X = (X + 2017) % M;

    cout << X << endl;
    return 0;
}