#include "bits/stdc++.h" using namespace std; #define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i)) #define rep(i,j) FOR(i,0,j) #define each(x,y) for(auto &(x):(y)) #define mp make_pair #define mt make_tuple #define all(x) (x).begin(),(x).end() #define debug(x) cout<<#x<<": "<<(x)< pii; typedef vector vi; typedef vector vll; class mint{ public: static long long MOD; mint():value(0){} mint(long long val):value(val<0?MOD+val%MOD:val%MOD){ } mint& operator+=(mint that){ value = value+that.value; if(value>=MOD)value-=MOD; return *this; } mint& operator-=(mint that){ value -= that.value; if(value<0)value+=MOD; return *this; } mint& operator*=(mint that){ value = value * that.value % MOD; return *this; } mint &operator/=(mint that){ return *this *= that.inverse(); } mint operator+(mint that) const{ return mint(*this)+=that; } mint operator-(mint that) const{ return mint(*this)-=that; } mint operator*(mint that) const{ return mint(*this)*=that; } mint operator/(mint that) const { return mint(*this) /= that; } mint operator^(long long k) const{ if(value==0)return 0; mint n = *this, res = 1; while(k){ if(k & 1)res *= n; n *= n; k >>= 1; } return res; } mint inverse() const { long long a = value, b = MOD, u = 1, v = 0; while(b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } return mint(u); } long long toll() const{ return value; } int toi() const{ return (int)value; } private: long long value; }; long long mint::MOD = 1000000007ll; int main(){ ios::sync_with_stdio(false); cin.tie(0); ll M; while(cin >> M) { mint::MOD = M; mint a = 2017; mint ans = a + ((a*a) ^ 2017); cout << ans.toi() << endl; } }