последняя

#include <iostream>
#include <string>
#include <sstream>
#include <cmath>
#include <memory.h>
#include <algorithm>
#include <stack>
#include <deque>
#include <iomanip>
#include <stdio.h>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <chrono>
#define int long long
#define pii pair <int, int>
#define pb push_back
#define all(vc) vc.begin(), vc.end()
#define fir first
#define sec second
//#define endl "\n"
#define un unsigned
#define INF 10000000000009
#define double long double
using namespace std;

const int N = 1000009, R = 1 << 11, MOD = 1e9 + 7;

vector<int> vc;

void rec(vector<int> &tree, int v, int n)
{
    if (v >= R)
    {
        return;
    }

    if (tree[v] == tree[v * 2])
    {
        vc.push_back(tree[v * 2 + 1]);
        rec(tree, v * 2, n);
    }
    else
    {
        vc.push_back(tree[v * 2]);
        rec(tree, v * 2 + 1, n);
    }

    return;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin >> n;

    vector<int> tree(2 * R + 1, -1);

    for (int i = 0; i < n; i++)
    {
        tree[i + R] = i + 1;
    }

    for (int i = R - 1; i > 0; i--)
    {
        int l = 2 * i, r = 2 * i + 1;

        if (tree[l] == -1 || tree[r] == -1)
        {
            tree[i] = max(tree[l], tree[r]);
            continue;
        }

        cout << "? " << tree[l] << " " << tree[r] << endl;

        char c;
        cin >> c;

        if (c == '>')
        {
            tree[i] = tree[l];
        }
        else
        {
            tree[i] = tree[r];
        }
    }

    rec(tree, 1, n);

    tree = vector<int>(R * 2 + 5, -1);

    for (int i = 0; i < vc.size(); i++)
    {
        tree[R + i] = vc[i];
    }

    n = vc.size();

    for (int i = R - 1; i > 0; i--)
    {
        int l = 2 * i, r = 2 * i + 1;

        if (tree[l] == -1 || tree[r] == -1)
        {
            tree[i] = max(tree[l], tree[r]);
            continue;
        }

        cout << "? " << tree[l] << " " << tree[r] << endl;

        char c;
        cin >> c;

        if (c == '>')
        {
            tree[i] = tree[l];
        }
        else
        {
            tree[i] = tree[r];
        }
    }

    cout << "! " << tree[1];
    return 0;
}