#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B, typename C>
struct triple {
  A X;
  B Y;
  C Z;
  triple(A a = 0, B b = 0, C c = 0) : X(a), Y(b), Z(c) {}
};
template <typename A, typename B, typename C>
triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) {
  return triple<A, B, C>(a, b, c);
}
template <typename A, typename B, typename C>
bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) {
  if (a.X != b.X) return a.X < b.X;
  if (a.Y != b.Y) return a.Y < b.Y;
  return a.Z < b.Z;
}
template <typename T, typename SS>
ostream& operator<<(ostream& ofs, const pair<T, SS>& p) {
  ofs << "( " << p.first << " , " << p.second << " )";
  return ofs;
}
template <typename T>
void print(T a) {
  for (auto i : a) cout << i << ' ';
  cout << '\n';
}
template <typename T>
T max(T a, T b, T c) {
  return max(a, max(b, c));
}
template <typename T>
T min(T a, T b, T c) {
  return min(a, min(b, c));
}
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count());
long long gcd(long long x, long long y) {
  if (!y) return x;
  return gcd(y, x % y);
}
signed main() {
  srand(time(NULL));
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(false);
  long long n;
  cin >> n;
  long long used = 0;
  long long l = 0, r = 1e9 + 1;
  while (r - l > 1) {
    long long m = l + r >> 1;
    cout << "> " << m << '\n';
    cout.flush();
    long long rr;
    cin >> rr;
    used++;
    if (rr)
      l = m + 1;
    else
      r = m;
  }
  long long mx;
  cout << "> " << l << '\n';
  cout.flush();
  long long rr;
  cin >> rr;
  used++;
  if (rr)
    mx = r;
  else
    mx = l;
  vector<long long> a;
  for (long long i = 1; i <= n; i++) a.push_back(i);
  long long mxl = n;
  vector<long long> b;
  for (long long _ = 0; _ < (59 - used); _++) {
    if (!mxl) break;
    long long x = rng32() % mxl;
    cout << "? " << a[x] << '\n';
    cout.flush();
    long long y;
    cin >> y;
    b.push_back(y);
    mxl--;
    swap(a[x], a[mxl]);
  }
  sort(b.begin(), b.end());
  b.push_back(mx);
  long long g = 0;
  for (long long i = 0; i + 1 < b.size(); i++) g = gcd(g, b[i + 1] - b[i]);
  cout << "! " << mx - (n - 1) * g << ' ' << g << '\n';
  cout.flush();
}
