#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

ll query(ll x) {
  cout << "? " << x << endl;
  cout.flush();
  ll res;
  cin >> res;
  return res;
}

void solve() {
  ll n;
  cin >> n;
  vector<ll> cnt(n + 10, -1);
  ll l = 0, r = n + 1, q = 10;
  cnt[l] = 0, cnt[r] = n;
  while (l + 1 < r) {
    ll m = (l + r) / 2;
    cnt[m] = query(m);
    q--;
    if (cnt[m] - cnt[l] < m - l) {
      r = m;
    } else {
      l = m;
    }
  }
  while (q--)
    query(1);
  cout << "Yes " << l << ' ' << r << endl;
  cout.flush();
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}