#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll INF = LLONG_MAX / 4;
#define rep(i, a, b) for(int i = a; i < (b); i++)
#define rrep(i, a, b) for(int i = (b)-1; i >= (a); i--)
#define all(a) begin(a), end(a)
bool chmin(auto& a, auto b) {return a > b ? a = b, 1 : 0; }
bool chmax(auto& a, auto b) {return a < b ? a = b, 1 : 0; }

void solve();

int main() {
    cin.tie(0) -> sync_with_stdio(false);
    
    int t = 1;
    // cin >> t;
    while(t--) {
        solve();
    }
}


void solve() {
    int t;
    cin >> t;
    int x1,x2,y1,y2;
    cin >> x1 >> y1 >> x2 >> y2;
    int l = 0, r = t;
    while(r - l > 1) {
        int mid = (r+l)/2;
        cout << "? " << mid << endl;
        int x,y;
        cin >> x >> y;
        if(abs(x1-x)+abs(y1-y) <= abs(x2-x)+abs(y2-y)) l = mid;
        else r = mid;
    }
    cout << "! " << l << endl;
}