// 長い夜の終わりを信じながら
// Think twice, code once.
#include <vector>
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
#define eputchar(c) putc(c, stderr)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define eputs(str) fputs(str, stderr), putc('\n', stderr)
using namespace std;

int n;
vector<int> vec({1, 2, 3});

int query(int a, int b, int c) {
	printf("? %d %d %d\n", a, b, c), fflush(stdout);
	int x;
	scanf("%d", &x);
	return x;
}

int main() {
	scanf("%d", &n);
	if (query(1, 2, 3) == -1) swap(vec[1], vec[2]);
	for (int i = 4; i <= n; i++) {
		int m = vec.size();
		int type = query(vec[0], vec[m / 2], i);
		int le, ri;
		if (type == 1) {
			int l = m / 2, r = m - 1;
			while (l < r) {
				int mid = (l + r) / 2 + 1;
				if (query(vec[0], vec[mid], i) == 1) l = mid;
				else r = mid - 1;
			}
			le = l, ri = (l + 1) % m;
		} else {
			int l = 1, r = m / 2;
			while (l < r) {
				int mid = (l + r) / 2;
				if (query(vec[0], vec[mid], i) == -1) r = mid;
				else l = mid + 1;
			}
			le = (r + m - 1) % m, ri = r;
		}
		if (query(vec[le], vec[ri], i) == 1) continue;
		while (query(vec[(le + m - 1) % m], vec[le], i) == -1) le = (le + m - 1) % m;
		while (query(vec[(ri + 1) % m], vec[ri], i) == 1) ri = (ri + 1) % m;
		vector<int> tmp({i});
		for (int j = ri; j != le; j = (j + 1) % m) tmp.push_back(vec[j]);
		tmp.push_back(vec[le]);
		vec.swap(tmp);
	}
	printf("! %d ", (int)vec.size());
	for (int i : vec) printf("%d ", i);
	puts(""), fflush(stdout);
	return 0;
}