import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readLong();
      
      bool check(long b) {
        const r = N % b;
        for (long n = N; n; n /= b) {
          if (r != n % b) {
            return false;
          }
        }
        return true;
      }
      
      long ans;
      if (N == 1) {
        ans = 2;
      } else if (N == 2) {
        ans = 3;
      } else {
        ans = N - 1;
        
        long[] bs;
        for (long b = 2; b^^2 <= N; ++b) {
          bs ~= b;
        }
        for (long d = 1; d^^2 <= N; ++d) {
          if (N % d == 0) {
            bs ~= d - 1;
            bs ~= N / d - 1;
          }
        }
        bs = bs.sort.uniq.array;
        foreach (b; bs) {
          if (b >= 2) {
            if (check(b)) {
              ans = b;
              break;
            }
          }
        }
      }
      writeln(ans);
      assert(check(ans));
    }
  } catch (EOFException e) {
  }
}