#include<bits/stdc++.h>
using namespace std;
int query(int a , int b , int c)
{
	cout << "? " << a << ' ' << b << ' ' << c << endl;
	int op; cin >> op; return op;
}
vector<int> convex(int n)
{
	deque<int>dq = {1 , 2 , 3};
	#define sz (int)dq.size()
	if(query(1 , 2 , 3) == 1)swap(dq[1] , dq[2]);
	for(int i = 4 ; i <= n ; i++)
	{
		int l = 0 , r = dq.size() - 1;
		while(l < r)
		{
			int mid = (l + r + 1) >> 1;
			if(query(dq[l] , dq[mid] , i) == 1)r = mid - 1;
			else l = mid;
		}
		if(query(dq[l] , dq[(l + 1) % sz] , i) == -1)continue ;
		rotate(dq.begin() , dq.begin() + l + 1 , dq.end());
		while(sz > 1 && query(i , dq[0] , dq[1]) == 1)dq.pop_front();
		while(sz > 1 && query(i , dq[sz - 1] , dq[sz - 2]) == -1)dq.pop_back();
		dq.push_front(i);
	}
	return vector<int>(dq.rbegin() , dq.rend());
}
int main()
{
	int n; cin >> n;
	auto vc = convex(n);
	cout << "! " << vc.size();
	for(int x : vc)cout << " " << x;
	cout << flush;
	return 0;
}