#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

map< int64_t, int > prime_factor(int64_t n) {
  map< int64_t, int > ret;
  for(int64_t i = 2; i * i <= n; i++) {
    while(n % i == 0) {
      ret[i]++;
      n /= i;
    }
  }
  if(n != 1) ret[n] = 1;
  return (ret);
}

using ll = int64;

ll extgcd(ll a, ll b, ll &x, ll &y) {
  ll g = a;
  x = 1;
  y = 0;
  if(b != 0) g = extgcd(b, a % b, y, x), y -= (a / b) * x;
  return g;
}

std::tuple< ll, ll, ll > extgcd(ll a, ll b) {
  ll x, y;
  ll g = extgcd(a, b, x, y);
  return std::make_tuple(x, y, g);
}


int main() {
  int64 N;
  cin >> N;
  // k(k+1)/2

  if(N == 1) {
    cout << 1 << "\n";
    exit(0);
  }
  if(N == 2) {
    cout << 3 << "\n";
    exit(0);
  }

  auto p = prime_factor(N);
  p[2]++;
  vector< pair< int64, int > > ps(begin(p), end(p));


  int64 ret = N - 1;


  auto dfs = MFP([&](auto dfs, int idx, int64 k) -> void {
    if(idx == (int) ps.size()) {
      int64 l = (N * 2) / k; // 残ったやつ
      // k*x +1 = l*y
      int64 x, y;
      extgcd(-k, l, x, y);
      if(k * x + 1 == l * y && x > 0) {
        chmin(ret, x * k);
      }
      return;
    }
    if(ps[idx].second > 0) {
      ps[idx].second--;
      dfs(idx, k * ps[idx].first);
      ps[idx].second++;
    }
    dfs(idx + 1, k);
  });
  dfs(0, 1);
  cout << ret << "\n";
}

Measured memory_bytes: 3660