#include <bits/stdc++.h>
using namespace std;
//*/
#include <atcoder/all>
using namespace atcoder;
//*/
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,a,b) for(int i=a;i<b;i++)
#define ALL(x) (x).begin(),(x).end()
#define dbgv(x); for(auto now : x) cout << now << " "; cout << endl;
//using P = pair<int,int>;
using ll = long long;
using ull = unsigned long long;
//*/
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<int> vint;
random_device rnd;
mt19937 rng(rnd());
using mint = modint998244353;


ll f(ll n){
  return n*(n+1)/2;
}
int query(int mid){
  int res;
  cout << "? " << mid << endl;
  cin >> res;
  return res;
}
void solve(){
  int n; cin >> n;
  int l = 1,r = n;
  vint memo(n+1,0);
  rep(i,10){
    int mid = (l+r)/2;
    int res = query(mid);
    if(mid != res) r = mid;
    else l = mid;
    if(memo[mid] != 0){
      cout << "Yes " << memo[mid] << " " << mid << endl;
      return;
    }
    memo[mid] = res;
  }
}


int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int t = 1; //cin >> t;
  rep(testcases,t) solve();
}