//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
template<typename T> using V = vector<T>;
template<typename T> using VV = vector<vector<T>>;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define siz(v) (ll)(v).size()
#define rep(i,a,n) for(ll i=a;i<(ll)(n);++i)
#define repr(i,a,n) for(ll i=n-1;(ll)a<=i;--i)
#define ENDL '\n'
typedef pair<int,int> Pi;
typedef pair<ll,ll> PL;
constexpr ll mod = 1000000007; // 998244353;
constexpr ll INF = 1000000099;
constexpr ll LINF = (ll)(1e18 +99);
const ld PI = acos((ld)-1);
const vector<ll> dx={-1,1,0,0},dy={0,0,-1,1};
template<typename T,typename U> inline bool chmin(T& t, const U& u){if(t>u){t=u;return 1;}return 0;}
template<typename T,typename U> inline bool chmax(T& t, const U& u){if(t<u){t=u;return 1;}return 0;}
template<typename T> inline T gcd(T a,T b){return b?gcd(b,a%b):a;}

template<typename T,typename Y> inline T mpow(T a, Y n) {
  T res = 1;
  for(;n;n>>=1) {
    if (n & 1) res = res * a;
    a = a * a;
  }
  return res;
}

template <typename T> V<T> prefix_sum(const V<T>& v) {
  int n = v.size();
  V<T> ret(n + 1);
  rep(i, 0, n) ret[i + 1] = ret[i] + v[i];
  return ret;
}

template<typename T>
istream& operator >> (istream& is, vector<T>& vec){
  for(auto&& x: vec) is >> x;
  return is;
}

template<typename T,typename Y>
ostream& operator<<(ostream& os,const pair<T,Y>& p){
  return os<<"{"<<p.fs<<","<<p.sc<<"}";
}

template<typename T> ostream& operator<<(ostream& os,const V<T>& v){
  os<<"{";
  for(auto e:v)os<<e<<",";
  return os<<"}";
}

template<typename ...Args>
void debug(Args&... args){
  for(auto const& x:{args...}){
    cerr<<x<<' ';
  }
  cerr<<ENDL;
}

vector<pair<ll, ll>> factorize(ll x) {  // vectorを返す関数
  vector<pair<ll, ll>> v;
  for(ll i = 2; i * i <= x; i++) {
    ll cnt = 0;
    while(x % i == 0) {
      x /= i;
      cnt++;
    }

    if(cnt) v.emplace_back(i, cnt);  //
  }
  if(x != 1) {
    if(v.size() && x == v.back().first)
      v.back().second++;  // xが素数だった時用 バグ?
    else
      v.emplace_back(x, 1);
  }

  return v;
}

template<typename T>
T extgcd(T a,T b,T &x,T &y){
  if(!b){x=1;y=0;return a;}
  T d=extgcd(b,a%b,y,x); 
  y-=(a/b)*x;
  return d;
}
//ax+by=gcd(a,b)を満たすx,y 返り値はgcd

signed main(){
  cin.tie(0);cerr.tie(0);ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(20);
  ll n;cin>>n;
  n*=2;

  V<PL> ps=factorize(n);


  ll ans=LINF;
  rep(i,0,1ll<<siz(ps)){
    ll a=1,b=1;

    rep(j,0,siz(ps)){
      ll tmp=pow(ps[j].fs,ps[j].sc);
      if((i&(1ll<<j)))a*=tmp;
      else b*=tmp;
    }

    if(a==1){
      chmin(ans,b-1);
      continue;
    }
    if(b==1){
      chmin(ans,a-1);
      continue;
    }

    ll x,y;
    extgcd(a,b,x,y);


    
    if(x<0){
      chmin(ans,-a*x);
    }else{
      chmin(ans,-b*y);
    }
  }

  cout<<ans<<ENDL;
}
//! ( . _ . ) ! 
//CHECK overflow,vector_size,what to output?

Measured memory_bytes: 4088