#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>

ll n, remain=10;

int main()
{
    cin >> n;
    ll l = 0, r = n;
    while(r-l>1)
    {
        remain--;
        ll m = (r+l)/2;
        cout << "? " << m+1 << endl;
        ll res;
        cin >> res;
        if(res==m+1) l = m;
        else r = m;
    }
    while(remain--)
    {
        cout << "? " << 1 << endl;
        ll res;
        cin >> res;
    }
    cout << "Yes " << r << " " << r+1 << endl;
}