# include <bits/stdc++.h>
using namespace std;
int que[5010];
vector<int> conv;
bool query(int i,int j,int k)
{
	printf("? %d %d %d\n",i,j,k);fflush(stdout);
	int ans;scanf("%d",&ans);
	return ans>0;
}
int main()
{
	int n;
	cin>>n;
	if(query(1,2,3)) conv={1,2,3};
	else conv={1,3,2};
	for(int i=4;i<=n;i++)
	{
		int sz=conv.size(),le=0,ri=0;
		if(query(conv[0],i,conv[1]))
		{
			for(int j=1;j<sz;j++) que[ri++]=conv[j];
			que[ri++]=conv[0];
		}
		else
		{
			int l=1,r=sz-1,mid;
			while(l<r)
			{
				mid=(l+r+1)/2;
				if(query(conv[0],conv[mid],i)) l=mid;
				else r=mid-1;
			}
			if(l<sz-1 && query(i,conv[l],conv[l+1])) continue;
			for(int j=l+1;j<sz;j++) que[ri++]=conv[j];
			for(int j=0;j<=l;j++) que[ri++]=conv[j];
		}
		while(le+1<ri && query(que[ri-2],i,que[ri-1])) ri--;
		while(le+1<ri && query(que[le+1],que[le],i)) le++;
		que[ri++]=i;
		conv=vector<int>(que+le,que+ri);
	}
	cout<<"! "<<conv.size();
	for(int i:conv) cout<<" "<<i;
	return puts(""),0;
}