#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<stdio.h>
#include<queue>
#include <climits>
const int mod = 1e9 + 7;
const int INF = 1e9;
using namespace std;
typedef long long ll;

template<class T>
bool chmin(T& a,T b){
    if(a < b){
        a = b;
        return true;
    }
    return false;
}

ll h[100010];
ll dp[100010];

int main()
{
    ll m;
    cin >> m;
    ll n = 2017 % m;
    ll k = (n * n) % m ;
    for(int i = 0 ; i < 2017; i++){
        k *= k;
        k %= m;
    }
    cout << (k + 2017) % m << endl;
}