#include<cstdio>
#include<algorithm>
//#define getchar getchar_unlocked
//#define putchar putchar_unlocked
template<typename T>void read(T &x){
x=0;bool f=0;char ch=getchar();
for(;ch<'0'||ch>'9';ch=getchar())if(ch=='-')f=1;
for(;ch>='0'&&ch<='9';ch=getchar())x=(x<<1)+(x<<3)+(ch^48);
if(f)x=-x;
}
void write(char x){putchar(x);}
template<typename T>void write(T x){
if(x<0)putchar('-'),x=-x;
char stk[24];int cnt=0;
do stk[++cnt]=x%10+48,x/=10;while(x);
for(;cnt;)putchar(stk[cnt--]);
}
template<typename T,typename ...Args>void read(T &x,Args &...args){read(x);read(args...);}
template<typename T,typename ...Args>void write(T x,Args ...args){write(x);write(args...);}
template<typename T>T min(T x,T y){return x<y?x:y;}
template<typename T>T max(T x,T y){return x>y?x:y;}
int n,last[1004],tot,ans[1004][1004],cnt,l[1004];
signed main(){
read(n);
l[1]=1;
for(int i=)
for(int i=1;i<=n;++i){
int l=1,r=i-1,jk=0;
for(;l<=r;){
int mid=(l+r)>>1;
write('?',' ',mid,' ',i,'\n');fflush(stdout);cnt++;
int tmp,op;read(tmp);ans[mid][i]=tmp;
if(ans[mid][i-1])op=ans[mid][i-1];
else write('?',' ',mid,' ',i-1,'\n'),fflush(stdout),read(op),cnt++;
if(tmp-op==i-mid+1)r=mid-1;
else jk=mid,l=mid+1;
}
last[i]=jk;
for(int j=jk+1;j<=i;++j)ans[j][i]=(j-i+1)*(j-i+2)/2;
}
write(cnt,'\n');
write('!',' ');
for(int i=1;i<=n;++i)
if(!last[i])write(last[i]=++tot,' ');
else write(last[i]=last[last[i]],' ');
fflush(stdout);
return 0;
}