package contest;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

public class Q721_2 {
	static Scanner in;
	static PrintWriter out;
	static String INPUT = "";
	
	static void solve()
	{
		int n = ni();
		in.nextLine();
		if(n == 1){
			out.println("! 1");
			out.flush();
			return;
		}
		int m = Integer.highestOneBit(n-1)*2;
		int[] a = new int[m];
		for(int i = 0;i < n;i++)a[i] = i+1;
		
		int z = Integer.numberOfTrailingZeros(m);
		for(int phase = 0;phase < z;phase++){
			for(int d = phase;d >= 0;d--){
				out.print("?");
				for(int i = 0;i < m>>>d+1;i++){
					for(int j = 0, 
							l = i<<~(phase-d)>=0 ? i<<d+1 : i<<d+1|1<<d,
							r = i<<~(phase-d)>=0 ? i<<d+1|1<<d : i<<d+1;
							j < 1<<d;
							j++,l++,r++){
						out.print(" " + a[l]);
						out.print(" " + a[r]);
					}
				}
				for(int i = m;i < 2*n;i++)out.print(" " + 0);
				out.println();
				out.flush();
				
				char[] s = in.nextLine().trim().toCharArray();
				int p = 0;
				for(int i = 0;i < m>>>d+1;i++){
					for(int j = 0;j < 1<<d;j++){
						if(s[p] == '>'){
							int e = a[i<<d+1|j]; a[i<<d+1|j] = a[i<<d+1|1<<d|j]; a[i<<d+1|1<<d|j] = e;
						}
						p+=2;
					}
				}
			}
		}
		
		out.print("!");
		for(int j = 0;j < m;j++){
			if(a[j] > 0){
				out.print(" " + a[j]);
			}
		}
		out.println();
		out.flush();
	}
	
	public static void main(String[] args) throws Exception
	{
		in = INPUT.isEmpty() ? new Scanner(System.in) : new Scanner(INPUT);
		out = new PrintWriter(System.out);
		
		solve();
		out.flush();
	}
	
	static int ni() { return Integer.parseInt(in.next()); }
	static long nl() { return Long.parseLong(in.next()); }
	static double nd() { return Double.parseDouble(in.next()); }
	static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}