#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

bool prie(int x)
{
    if (x <= 1)
    {
        return 0;
    }
    else
    {
        for (int i = 2; i * i <= x; i++)
        {
            if (x % i == 0)
            {
                return 0;
            }
        }
        return 1;
    }
}

long long safe_mod(long long x, long long m) {
    x %= m;
    if (x < 0) x += m;
    return x;
}

std::pair<long long, long long> inv_gcd(long long a, long long b) {
    a = safe_mod(a, b);
    if (a == 0) return {b, 0};

    // Contracts:
    // [1] s - m0 * a = 0 (mod b)
    // [2] t - m1 * a = 0 (mod b)
    // [3] s * |m1| + t * |m0| <= b
    long long s = b, t = a;
    long long m0 = 0, m1 = 1;

    while (t) {
        long long u = s / t;
        s -= t * u;
        m0 -= m1 * u;  // |m1 * u| <= |m1| * s <= b

        // [3]:
        // (s - t * u) * |m1| + t * |m0 - m1 * u|
        // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)
        // = s * |m1| + t * |m0| <= b

        auto tmp = s;
        s = t;
        t = tmp;
        tmp = m0;
        m0 = m1;
        m1 = tmp;
    }
    // by [3]: |m0| <= b/g
    // by g != b: |m0| < b/g
    if (m0 < 0) m0 += b / s;
    return {s, m0};
}

std::pair<long long, long long> crt(const std::vector<long long>& r,
                                    const std::vector<long long>& m) {
    assert(r.size() == m.size());
    int n = int(r.size());
    // Contracts: 0 <= r0 < m0
    long long r0 = 0, m0 = 1;
    for (int i = 0; i < n; i++) {
        assert(1 <= m[i]);
        long long r1 = safe_mod(r[i], m[i]), m1 = m[i];
        if (m0 < m1) {
            std::swap(r0, r1);
            std::swap(m0, m1);
        }
        if (m0 % m1 == 0) {
            if (r0 % m1 != r1) return {0, 0};
            continue;
        }
        // assume: m0 > m1, lcm(m0, m1) >= 2 * max(m0, m1)

        // (r0, m0), (r1, m1) -> (r2, m2 = lcm(m0, m1));
        // r2 % m0 = r0
        // r2 % m1 = r1
        // -> (r0 + x*m0) % m1 = r1
        // -> x*u0*g % (u1*g) = (r1 - r0) (u0*g = m0, u1*g = m1)
        // -> x = (r1 - r0) / g * inv(u0) (mod u1)

        // im = inv(u0) (mod u1) (0 <= im < u1)
        long long g, im;
        std::tie(g, im) = inv_gcd(m0, m1);

        long long u1 = (m1 / g);
        // |r1 - r0| < (m0 + m1) <= lcm(m0, m1)
        if ((r1 - r0) % g) return {0, 0};

        // u1 * u1 <= m1 * m1 / g / g <= m0 * m1 / g = lcm(m0, m1)
        long long x = (r1 - r0) / g % u1 * im % u1;

        // |r0| + |m0 * x|
        // < m0 + m0 * (u1 - 1)
        // = m0 + m0 * m1 / g - m0
        // = lcm(m0, m1)
        r0 += x * m0;
        m0 *= u1;  // -> lcm(m0, m1)
        if (r0 < 0) r0 += m0;
    }
    return {r0, m0};
}

ll first(ll x, ll y)
{
    ll sol = 0;
    while (sol % x || (sol + 1) % y)
    {
        sol++;
    }
    return sol;
}

ll second(ll x, ll y)
{
    return crt({0, y - 1}, {x, y}).first;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    /**for (int i = 1; i <= 100; i++)
    {
        if (!prie(i))
        {
            continue;
        }
        for (int j = 1; j <= 100; j++)
        {
            if (i != j && prie(j))
            {
                cout << i << " " << j << " : " << first(i, j) << ", " << second(i, j) << "\n";
            }
        }
        cout << "\n";
    }
    return 0;**/

    ll n, sol = (ll) 1e18;
    cin >> n;
    n *= 2;
    vector<ll> v;
    for (ll d = 2; d * d <= n; d++)
    {
        ll c = 1;
        while (n % d == 0)
        {
            n /= d;
            c *= d;
        }
        if (c > 1)
        {
            v.push_back(c);
        }
    }
    if (n > 1)
    {
        v.push_back(n);
    }
    int k = (int) v.size();
    for (int m = 0; m < (1 << k) - 1; m++)
    {
        ll x = 1, y = 1;
        for (int i = 0; i < k; i++)
        {
            if (m & (1 << i))
            {
                x *= v[i];
            }
            else
            {
                y *= v[i];
            }
        }
        sol = min(sol, second(x, y));
    }
    cout << sol << "\n";
}


Measured memory_bytes: 3676