#define CPP17
#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#ifdef CPP17
#include <variant>
#endif

#define endl codeforces

#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)

using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
using size_type = ssize_t;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }

template <typename T, std::size_t Head, std::size_t... Tail> 
struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };

template <typename T, std::size_t Head> 
struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };

template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;

#ifdef CPP17
template <typename T, typename F, typename... Args> 
void fill_seq(T &t, F f, Args... args) { 
    if constexpr (std::is_invocable<F, Args...>::value) { 
        t = f(args...); 
    } else { 
        for (size_type i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); 
    } 
}
#endif

template <typename T> vec<T> make_v(size_type sz) { return vec<T>(sz); }

template <typename T, typename... Tail> 
auto make_v(size_type hs, Tail&&... ts) { 
    auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); 
    return vec<decltype(v)>(hs, v); 
}

namespace init__ { 
struct InitIO { 
    InitIO() { 
        std::cin.tie(nullptr); 
        std::ios_base::sync_with_stdio(false); 
        std::cout << std::fixed << std::setprecision(30); 
    } 
} init_io; 
}
template <typename T>
T ceil_pow2(T bound) {
    T ret = 1;
    while (ret < bound) ret *= 2;
    return ret;
}
template <typename T>
T ceil_div(T a, T b) { return a / b + !!(a % b); }
#define CPP17


namespace math {

template <typename T>
constexpr T pow(const T &n, ll k) {
    T ret = n.mul_id_ele();
    T cur = n;
    while (k) {
        if (k & 1) ret *= cur;
        cur *= cur;
        k /= 2;
    }
    return ret;
}


ll gcd(ll a, ll b) { return b ? gcd(a % b, b) : a; }

}

namespace math {

// return (x, y) s.t. ax + by = 1
tll ext_euclidean(ll a, ll b) {
    if (b == 0) return tll(1, 0, a);
    auto [ xr, yr, g ] = ext_euclidean(b, a % b);
    ll x = yr;
    ll y = xr - a / b * x;
    return tll(x, y, g);
}

// return (x, y) s.t. ax + by = d
tll ext_euclidean(ll a, ll b, ll d) {
    auto [ x, y, g ] = ext_euclidean(a, b);
    if (d % g) return tll(-1, -1, -1);
    ll mul = d / g;
    return tll(x * mul, y * mul, g);
}

pll chinese_remainder(ll b1, ll m1, ll b2, ll m2) {
    if (b1 > b2) {
        std::swap(b1, b2);
        std::swap(m1, m2);
    }
    auto [ p, q, g ] = ext_euclidean(m1, m2);
    if ((b2 - b1) % g) return pll(-1, -1);
    ll m = m1 / g * m2;
    ll tmp = (b2 - b1) / g * p % (m2 / g);
    ll x = (b1 + tmp * m1 + m) % m;
    return pll(x, m);
}

pll chinese_remainder(const vec<ll> &bv, const vec<ll> &mv) {
    assert(bv.size() == mv.size());
    ll b = 0, m = 1;
    size_type sz = bv.size();
    for (size_type i = 0; i < sz; i++) {
        std::tie(b, m) = chinese_remainder(b, m, bv[i], mv[i]);
        if (b == -1) return pll(-1, -1);
    }
    return pll(b, m);
}

}

ll solve(ll n) {
    if (n == 1) return 1;
    
    n *= 2;

    ll ans = n;

    auto update = [&](ll k) {
        ll rest = n / k;
        auto [ a, b, c ] = math::ext_euclidean(k, rest, 1);
        if (c == -1) return;
        ll n1 = std::abs(k * a);
        ll n2 = std::abs(rest * b);
        ll tmp = std::min(n1, n2);
        if (tmp == 0) return;
        chmin(ans, tmp);
    };
    
    for (ll i = 1; i * i <= n; i++) {
        if (n % i) continue;
        update(i);
        update(n / i);
    }
    return ans;
}

int main() {
    ll n;
    std::cin >> n;
    std::cout << solve(n) << "\n";
    return 0;

}


Measured memory_bytes: 3656