public static void Solve(Scanner cin)
		{
			var n = cin.ReadInt();
			var all = n * n - n;

			//var a = cin.ReadIntArray(all);
			int[] a = null;

			var ans = SolveCheck(n, all, a, cin);
			if (a != null)
			{
				for (int i = 0; i < all; i++)
				{
					if (a[i] != ans[i])
					{
						Console.WriteLine("Assertion Failed!");
						Console.WriteLine($"n: {n}");
						Console.WriteLine($"a: {a.Join(" ")}");
					}
				}
			}
		}

		public static int[] SolveCheck(int n, int all, int[] a, Scanner cin)
		{
			int timesAsked = 0;

			// if the return value is P, then ret[P + n] increments
			var ret = new int[n * 2 + 1];
			// the answers of the queries
			var qa = new (int p, int q)[all];
			var dic = new SortedDictionary<(int p, int q), List<int>>();

			ret[n] += 2;
			dic.Add((0, 0), new List<int>());
			dic[(0, 0)].Add(0);
			for (int i = 1; i < all; i++)
			{
				timesAsked++;
				if (timesAsked > all * 3 / 2) throw new Exception();
				var (p, q) = Ask(0, i, cin, a, n);
				qa[i] = (p, q);
				if (!dic.ContainsKey((p, q))) dic.Add((p, q), new List<int>());
				dic[(p, q)].Add(i);
				ret[p + n]++;
				ret[q + n]++;
			}

			bool isBigDigit = false;
			bool isSmallDigit = false;
			int leftBigDigit = -1;
			int rightBigDigit = -1;
			int leftSmallDigit = -1;
			int rightSmallDigit = -1;

			for (int i = 0; i < n * 2 + 1; i++)
			{
				if (ret[i] == n || ret[i] == 2 * n - 1)
				{
					if (!isBigDigit) leftBigDigit = i - n;
					isBigDigit = true;
				}
				else
				{
					if (isBigDigit) rightBigDigit = i - n;
					isBigDigit = false;
				}

				if (ret[i] == n - 1 || ret[i] == 2 * n - 1)
				{
					if (!isSmallDigit) leftSmallDigit = i - n;
					isSmallDigit = true;
				}
				else
				{
					if (isSmallDigit) rightSmallDigit = i - n;
					isSmallDigit = false;
				}
			}

			Debug.Assert(rightBigDigit - leftBigDigit == n - 1);
			Debug.Assert(rightSmallDigit - leftSmallDigit == n);

			var ans = new (int big, int small)[all];
			ans[0] = (1 - leftBigDigit, -leftSmallDigit);

			var oneZeroPair = (leftBigDigit, leftSmallDigit);
			if (leftBigDigit > leftSmallDigit) oneZeroPair = (leftSmallDigit, leftBigDigit);
			var oneZero = dic[oneZeroPair][0];
			Debug.Assert(dic[oneZeroPair].Count == 1);

			var zeroMaxPair = (big: leftBigDigit, small: rightSmallDigit - 1);
			if (leftBigDigit > rightSmallDigit - 1) zeroMaxPair = (rightSmallDigit - 1, leftBigDigit);
			var zeroMax = dic[zeroMaxPair][0];
			if (dic[zeroMaxPair].Count >= 2)
			{
				var revMaxZeroPair = (zeroMaxPair.small, zeroMaxPair.big);
				var genuine = (big: rightBigDigit - 1, small: leftSmallDigit);
				var fake = (big: leftSmallDigit, small: rightBigDigit - 1);
				var first = dic[zeroMaxPair][0];
				var second = dic[zeroMaxPair][1];

				var expected = (0, n - 1);
				timesAsked++;
				if (timesAsked > all * 3 / 2) throw new Exception();
				var check = Ask(oneZero, first, cin, a, n);
				if (expected == check)
				{
					zeroMax = first;
					qa[first] = genuine;
					qa[second] = fake;
				}
				else
				{
					zeroMax = second;
					qa[first] = fake;
					qa[second] = genuine;
				}
			}

			foreach (var e in dic)
			{
				if (e.Value.Count >= 2)
				{
					var genuine = e.Key;
					var fake = (p: e.Key.q, q: e.Key.p);

					var expected = (big: ans[0].big + genuine.p - 1, small: ans[0].small + genuine.q - (n - 1));
					if (expected.big > expected.small)
					{
						var t = expected.big;
						expected.big = expected.small;
						expected.small = t;
					}
					timesAsked++;
					if (timesAsked > all * 3 / 2) throw new Exception();
					var check = Ask(zeroMax, e.Value[0], cin, a, n);
					if (expected == check)
					{
						qa[dic[e.Key][0]] = genuine;
						qa[dic[e.Key][1]] = fake;
					}
					else
					{
						qa[dic[e.Key][0]] = fake;
						qa[dic[e.Key][1]] = genuine;
					}
				}
			}

			for (int i = 0; i < all; i++)
			{
				var (p, q) = qa[i];
				if (leftBigDigit <= p && p < rightBigDigit && leftSmallDigit <= q && q < rightSmallDigit)
				{
					// do nothing
				}
				else
				{
					var t = p;
					p = q;
					q = t;
				}
				ans[i] = (ans[0].big + p, ans[0].small + q);

			}

			var answer = ans.Select(p => p.big * n + p.small).ToArray();
			Answer(answer);
			return answer;
		}

		public static (int p, int q) Ask(int i, int j, Scanner cin, int[] ans, int n)
		{
			if (ans == null)
			{
				Console.WriteLine($"? {j + 1} {i + 1}");
				Console.Out.Flush();
				var (p, q) = cin.ReadValue<int, int>();
				return (p, q);
			}
			else
			{
				Console.WriteLine($"? {j + 1} {i + 1}");
				var p = ans[j] / n - ans[i] / n;
				var q = ans[j] % n - ans[i] % n;
				if (p > q)
				{
					var t = p;
					p = q;
					q = t;
				}
				Console.WriteLine($"\t{p} {q}");
				Console.Out.Flush();
				return (p, q);
			}
		}

		public static void Answer(IEnumerable<int> a)
		{
			Console.WriteLine($"! {a.Join(" ")}");
			Console.Out.Flush();
			return;
		}