https://codeforces.com/gym/102168/problem/F

#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()

using namespace std;
using ll = long long;

char ask(const vector<int>& a, const vector<int>& b) {
    cout << "? " << a.size() << "\n";
    for (int val : a) {
        cout << val + 1 << ' ';
    }
    cout << '\n';
    for (int val : b) {
        cout << val + 1 << ' ';
    }
    cout << endl;
    char res;
    cin >> res;
    return res;
}

void PrintAnswer(int val) {
    cout << "! " << val + 1 << endl;
    exit(0);
}

void Solve(vector<int> arr, char bad) {
    if (arr.size() == 1) {
        PrintAnswer(arr[0]);
    } else if (arr.size() == 2) {
        vector<int> a = {arr[0]}, b = {arr[1]};
        if (ask(a, b) == bad) {
            PrintAnswer(arr[1]);
        } else {
            PrintAnswer(arr[0]);
        }
    } else {
        vector<int> a, b;
        const int n = arr.size();
        int sz = n / 3 + ((n % 3 == 2) ? 1 : 0);
        for (int i = 0; i < sz; i++) {
            a.push_back(arr[i]);
            b.push_back(arr[i + sz]);
        }
        auto res = ask(a, b);
        if (res == '=') {
            vector<int> c;
            for (int i = 2 * sz; i < n; i++) {
                c.push_back(arr[i]);
            }
            Solve(c, bad);
        } else {
            if (res == bad) {
                Solve(b, bad);
            } else {
                Solve(a, bad);
            }
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n;
    cin >> n;
    vector<int> a, b;
    int sz = n / 3 + (n % 3 == 2 ? 1 : 0);
    for (int i = 0; i < sz; i++) {
        a.push_back(i);
        b.push_back(sz + i);
    }
    auto res = ask(a, b);
    if (res == '=') {
        vector<int> c;
        for (int i = 2 * sz; i < n; i++) {
            c.push_back(i);
        }
        a.clear();
        for (int i = 0; i < c.size(); i++) {
            a.push_back(i);
        }
        Solve(c, ask(a, c));
    } else {
        if (n <= 9) {
            for (int i = 0; i < n - 1; i++) {
                if (ask({i}, {n - 1}) != '=') {
                    PrintAnswer(i);
                }
            }
        }
        vector<int> c;
        for (int i = 0; i < sz; i++) {
            c.push_back(n - 1 - i);
        }
        sort(all(c));
        auto curResult = ask(a, c);
        if (curResult == '=') {
            Solve(b, res);
        } else {
            Solve(a, res == '>' ? '<' : '>');
        }
    }
}