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)); }

uint xrand() {
  static uint x = 314159265, y = 358979323, z = 846264338, w = 327950288;
  uint t = x ^ x << 11; x = y; y = z; z = w; return w = w ^ w >> 19 ^ t ^ t >> 8;
}

BigInt power(BigInt a, BigInt e, BigInt m) {
  BigInt x = a % m, y = 1 % m;
  for (; e > 0; e >>= 1) {
    if (e & 1) y = (y * x) % m;
    x = (x * x) % m;
  }
  return y;
}

BigInt N;

BigInt Ask(BigInt a) {
  debug {
    assert(0 < a);
    assert(a < N);
    assert(gcd(a, N) == 1);
    BigInt aa = 1;
    for (long r = 1; ; ++r) {
      aa = (aa * a) % N;
      if (aa == 1) {
        writefln("Ask %s = %s", a, r);
        stdout.flush;
        return BigInt(r);
      }
    }
  } else {
    writefln("? %s", a);
    stdout.flush;
    const res = BigInt(readToken());
    return res;
  }
}

void Answer(BigInt p, BigInt q) {
  writefln("! %s %s", p, q);
  stdout.flush;
  debug {
    assert(p > 1);
    assert(q > 1);
    assert(p * q == N);
  }
  import core.stdc.stdlib;
  exit(0);
}

void main() {
  N = BigInt(readToken());
  for (; ; ) {
    BigInt a;
    for (; a < N; ) {
      a = a << 32 | xrand();
    }
    a %= N;
    if (a == 0) {
      continue;
    }
    {
      const d = gcd(a, N);
      if (d != 1) {
        Answer(d, N / d);
      }
    }
    const r = Ask(a);
    if (r % 2 == 0) {
      const b = power(a, r / 2, N);
      if (b != 1) {
        foreach (c; [b + 1, b - 1]) {
          const d = gcd(c, N);
          if (d != 1) {
            Answer(d, N / d);
          }
        }
      }
    }
  }
}