#include <iostream>

#include <cstdio>

#include <cstring>

#include <cmath>

#include <algorithm>

#define ll long long

using namespace std;

#define NN 370000

class ChooseTheBestOne

{

private:

public:

    ll calc3(int n)

    {

        return (ll)pow(n,);

    }

    int countNumber(int N)

    {

        ll now = ,remain = (ll)(N-);

        ll rd = ;

        ll pos;

        int has[];

        memset(has,-,sizeof(has));

        has[] = ;

        while(rd < N)

        {

            while(has[now] == )

            {

                now = (now+)%N;

            }

            ll call = calc3(rd);

            ll add = (call-)%remain;

            ll k = ;

            for(pos=now;k<add;)

            {

                pos = (pos+)%N;

                if(has[pos] != )

                    k++;

            }

            has[pos] = ;

            now = (pos+)%N;

            //cout<<"出去： "<<pos+1<<"   现在"<<now+1<<endl;

            remain--;

            rd++;

        }

        ll i;

        for(i=;i<N;i++)

        {

            if(has[i] == -)

            {

                return i+;

            }

        }

    }

};

int main()

{

    ChooseTheBestOne *kc = new ChooseTheBestOne();

    cout<<(*kc).countNumber()<<endl;

    return ;

}