#include int main () { int n = 0; int ret = 0; int res = 0; int q[400] = {}; int rem[400] = {}; res = scanf("%d", &n); for (int i = 0; i < n; i++) { rem[i] = i+1; } for (int i = 0; i < n; i++) { int idx[2] = { 0, n-i }; while (idx[1]-idx[0] > 1) { int nxt = (idx[0]+idx[1])/2; printf("?"); for (int j = 0; j < i; j++) { printf(" %d", q[j]); } printf(" %d", rem[nxt]); for (int j = 0; j < nxt; j++) { printf(" %d", rem[j]); } for (int j = nxt+1; j < n-i; j++) { printf(" %d", rem[j]); } printf("\n"); fflush(stdout); res = scanf("%d", &ret); if (ret > 0) { idx[0] = nxt; } else { idx[1] = nxt; } } q[i] = rem[idx[0]]; for (int j = idx[0]; j < n-i-1; j++) { rem[j] = rem[j+1]; } } printf("!"); for (int j = 0; j < n; j++) { printf(" %d", q[j]); } printf("\n"); fflush(stdout); return 0; }