#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <random>
#include <iomanip>
#include <time.h>
#include <bitset>
#include <map>
#include <numeric>
#include <atcoder/modint>
#include <atcoder/dsu>
using namespace atcoder;
using namespace std;
using mint = modint998244353;
#define ll long long
#define pll pair<ll,ll>

void solve(ll l, ll r, ll lmin, ll rmax, ll remain=10)
{
    if(r-l==1)
    {
        for(int i=0; i<remain; i++)
        {
            cout << "? " << 1 << endl;
            ll tmp;
            cin >> tmp;
        }
        cout << "Yes " << r << " " << r+1 << endl;
        return;
    }
    ll m = (r+l)/2;
    cout << "? " << m+1 << endl;
    ll res = 0;
    cin >> res;
    //[l,m]に最大でres-lmin+1種類存在
    //[m,r)に最大でrmax-res+1種類存在
    if(m-l+1>res-lmin+1) solve(l,m,lmin,res,remain-1);
    else solve(m,r,res,rmax,remain-1);
}

ll n;

int main()
{
    cin >> n;
    solve(0,n,1,n);
}