using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Threading;
using System.Runtime.CompilerServices;
using System.Text;
using System.Diagnostics;
using System.Numerics;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Template;
using SC = Scanner;

public partial class Solver
{
    public void Solve()
    {
        var N = sc.Long;
        if (N == 1) Fail(1);
        var f = FastFactorize.Factorize(2*N);
        var pw = new long[f.Count];var idx = 0;
        foreach (var p in f)
        {
            pw[idx] = 1;
            for (int k = 0; k < p.Value; k++) pw[idx] *= p.Key;
            idx++;
        }
        var res = N - 1;
        for(int i = 1; i < (1 << pw.Length)-1; i++)
        {
            var a = 1L;var b = 1L;
            for (int j = 0; j < pw.Length; j++)
            {
                if ((1 & i >> j) == 1)
                {
                    a *= pw[j];
                } else b *= pw[j];
            }

            long x = 0, y = 0;
            extGCD(a, b, ref x, ref y);
            chmin(ref res, a * Abs(x));
        }
        Console.WriteLine(res);
    }
    long extGCD(long a,long b,ref long x,ref long y)
    {
        if (b == 0)
        {
            x = 1;y = 0;return a;
        }
        var d = extGCD(b, a % b, ref y, ref x);
        y -= a / b * x;
        return d;
    }
}

class FastFactorize
{
    //ミラーラビン素数判定法とロー法による素因数分解　モンテカルロ法
    //http://joisino.hatenablog.com/entry/2017/08/03/210000
    //http://miller-rabin.appspot.com/
    //https://mathtrain.jp/rhoalgorithm
    static readonly long[] small = new[] { 2L, 7, 61 };
    static readonly long[] big = new[] { 2L, 325, 9375, 28178, 450775, 9780504, 1795265022 };
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    private static long F(long v, long m) => (long)(((BigInteger)v * v + 1) % m);
    private static long GCD(long a, long b) => a < b ? GCD(b, a) : b > 0 ? GCD(b, a % b) : a;
    public static Dictionary<long, int> Factorize(long x)
    {
        var res = new Dictionary<long, int>();
        var st = new List<long> { x };
        while (st.Count > 0)
        {
            var now = st.PopBack();
            if (now == 1) continue;
            if (IsPrime(now))
            {
                if (!res.ContainsKey(now)) res[now] = 0;
                res[now]++;
                continue;
            }
            long f = Find(now);
            st.Add(f);
            st.Add(now / f);
        }
        return res;
    }
    static readonly long[] prime = new[] { 2L, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37 };
    public static bool IsPrime(long x)
    {
        if (x < 2) return false;
        if (prime.Contains(x)) return true;
        var d = x - 1;
        var count2 = 0;
        while ((d & 1) == 0) { d >>= 1; count2++; }
        foreach (var v in (x >> 33) == 0 ? small : big)
        {
            if (v == x) return true;
            var calc = ModPow(v, d, x);
            if (calc == 1) continue;
            var ok = true;
            for (int r = 0; r < count2; r++)
            {
                ok &= calc != x - 1;
                if (!ok) break;
                calc = ModPow(calc, 2, x);
            }
            if (ok) return false;
        }
        return true;
    }
    static Random rnd = new Random();
    private static long Find(long x)
    {
        foreach (var p in prime) if (x % p == 0) return p;
        var r = rnd.Next(1, 1001001);
        while (true)
        {
            ++r;
            long a = r % x;
            long b = F(r, x);
            long d = 1;
            while (true)
            {
                d = GCD(Abs(a - b), x);
                if (d >= x) break;
                if (d > 1) return d;
                a = F(a, x);
                b = F(F(b, x), x);
            }
        }
    }
    private static long ModPow(long a, long b, long c)
    {
        BigInteger res = 1, now = a % c;
        while (b != 0)
        {
            if ((b & 1) == 1)
            {
                res = res * now % c;
            }
            now = now * now % c;
            b >>= 1;
        }
        return (long)res;
    }
}
#region Template
public partial class Solver
{
    public SC sc = new SC();
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        var sol = new Solver();
        int testcase = 1;
        //testcase = sol.sc.Int;
        //var th = new Thread(sol.Solve, 1 << 26);th.Start();th.Join();
        while (testcase-- > 0)
            sol.Solve();
        Console.Out.Flush();
    }
}
public static class Template
{
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) > 0) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(this IList<T> A, int i, int j) { var t = A[i]; A[i] = A[j]; A[j] = t; }
    public static T[] Create<T>(int n, Func<T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; }
    public static T[] Create<T>(int n, Func<int, T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; }
    public static void Out<T>(this IList<T> A, out T a) => a = A[0];
    public static void Out<T>(this IList<T> A, out T a, out T b) { a = A[0]; b = A[1]; }
    public static void Out<T>(this IList<T> A, out T a, out T b, out T c) { A.Out(out a, out b); c = A[2]; }
    public static void Out<T>(this IList<T> A, out T a, out T b, out T c, out T d) { A.Out(out a, out b, out c); d = A[3]; }
    public static string Concat<T>(this IEnumerable<T> A, string sp) => string.Join(sp, A);
    public static char ToChar(this int s, char begin = '0') => (char)(s + begin);
    public static IEnumerable<T> Shuffle<T>(this IEnumerable<T> A) => A.OrderBy(v => Guid.NewGuid());
    public static int CompareTo<T>(this T[] A, T[] B, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; for (var i = 0; i < Min(A.Length, B.Length); i++) { int c = cmp(A[i], B[i]); if (c > 0) return 1; else if (c < 0) return -1; } if (A.Length == B.Length) return 0; if (A.Length > B.Length) return 1; else return -1; }
    public static string ToStr<T>(this T[][] A) => A.Select(a => a.Concat(" ")).Concat("\n");
    public static int ArgMax<T>(this IList<T> A, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; T max = A[0]; int rt = 0; for (int i = 1; i < A.Count; i++) if (cmp(max, A[i]) < 0) { max = A[i]; rt = i; } return rt; }
    public static T PopBack<T>(this List<T> A) { var v = A[A.Count - 1]; A.RemoveAt(A.Count - 1); return v; }
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
}
public class Scanner
{
    public string Str => Console.ReadLine().Trim();
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
    public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
    public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
    public int[] ArrInt1D(int n) => Create(n, () => Int);
    public long[] ArrLong1D(int n) => Create(n, () => Long);
    public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
    public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
    private Queue<string> q = new Queue<string>();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
    public void Make<T1>(out T1 v1) => v1 = Next<T1>();
    public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
    public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
    public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }
    public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }
    public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); }
    public void Make<T1, T2, T3, T4, T5, T6, T7>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6, out T7 v7) { Make(out v1, out v2, out v3, out v4, out v5, out v6); v7 = Next<T7>(); }
    public (T1, T2) Make<T1, T2>() { Make(out T1 v1, out T2 v2); return (v1, v2); }
    public (T1, T2, T3) Make<T1, T2, T3>() { Make(out T1 v1, out T2 v2, out T3 v3); return (v1, v2, v3); }
    public (T1, T2, T3, T4) Make<T1, T2, T3, T4>() { Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4); return (v1, v2, v3, v4); }
}

#endregion


Measured memory_bytes: 35728