#include <cstdio>
#include <algorithm>
#define long long long
using namespace std;
const long mod = 25602017ll;
const long invmod = 25602015ll;

long n;

long pow(long m){
    if(m==1)return n%mod;
    long now = pow(m/2ll)%mod;
    now*=now;
    now%=mod;
    if(m%2ll)now*=n%mod;
    now%=mod;
    return now;
}

long solve(){
    long now = pow(n);
    now-=1;
    now*=n%mod;
    now/=(n-1)%invmod;
    return now;
}

int main(){
    //freopen("r","r",stdin);
    scanf("%lld",&n);
    printf("%lld\n",solve());
}