//#pragma GCC target("avx2,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <atcoder/all>
using namespace atcoder;
//using mint = modint998244353;
//using mint = modint1000000007;
#include <bits/stdc++.h>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
using i128 = __int128_t;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
constexpr char ln = '\n';
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}
inline int topbit(int x) {return x == 0 ? -1 : 31-__builtin_clz(x);}
inline int topbit(long long x) {return x == 0 ? -1 : 63-__builtin_clzll(x);}
inline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}
inline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}
inline int popcount(int x) {return __builtin_popcount(x);}
inline int popcount(long long x) {return __builtin_popcountll(x);}
inline int kthbit(long long x, int k) {return (x>>k)&1;}
inline void print() {cout << "\n";}
template<class T>
inline void print(const vector<T> &v) {
    for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << " ";
    print();
}
template<class T, class... Args>
inline void print(const T &x, const Args &... args) {
    cout << x << " ";
    print(args...);
}
#ifdef MINATO_LOCAL
#define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
inline void debug() {cerr << endl;}
template<class T>
inline void debug(const vector<T> &v) {
    for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << " ";
    debug();
}
template<class T, class... Args>
inline void debug(const T &x, const Args &... args) {
    cerr << x << " ";
    debug(args...);
}
#else
#define dump(x) void(0)
inline void debug() {}
template<class T> inline void debug(const vector<T> &v) {}
template<class T, class... Args> inline void debug(const T &x, const Args &... args) {}
#endif
struct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

vector<bool> sieve(int N) {
    vector<bool> ret(N+1,true);
    
    ret[0] = ret[1] = false;
    for (int i = 2; i*i <= N; ++i) {
        if (ret[i]) {
            for (int j = 2; j*i <= N; ++j) {
                ret[j*i] = false;
            }
        }
    }

    return ret;
}

int MAX = 100000;

int main() {
    auto prime = sieve(MAX);
    ll N; cin >> N;
    if (N==1) {
        cout << 1 << ln;
        return 0;
    }
    ll ans = (N%2==1 ? N-1 : N);
    ll K = N;
    vector<pll> A;
    for (ll i = 1; i <= MAX; i++) {
        if (prime[i] and K%i==0) {
            int cnt = 0;
            while (K%i==0) {
                cnt++;
                K /= i;
            }
            A.emplace_back(i,cnt);
        }
    }
    if (A.empty()) {
        cout << ans << ln;
        return 0;
    }
    if (K != 1) A.emplace_back(K,1);
    // for (auto i : A) {
    //     cout << i.first << " " << i.second << ln;
    // }
    {
        bool ok = false;
        rep(i,SZ(A)) {
            if (A[i].first==2) {
                ok = true;
                A[i].second++;
                break;
            }
        }
        if (!ok) A.emplace_back(2,1);
        sort(all(A));
    }
    vector<ll> B;
    rep(i,SZ(A)) {
        ll val = 1;
        rep(j,A[i].second) val *= A[i].first;
        B.emplace_back(val);
    }
    int M = A.size();
    rep(mask,1<<M) {
        ll v1 = 1, v2 = 1;
        rep(i,M) {
            if (kthbit(mask,i)) v1 *= B[i];
            else v2 *= B[i];  
        }
        if (v1==1 or v2==1) continue;
        ll x = inv_mod(v1,v2);
        i128 xx = x;
        xx *= v1;
        xx--;
        chmin(ans,xx);
    }

    cout << ans << ln;
}


Measured memory_bytes: 3744