AT_arc192_c [ARC192C] Range Sums 2

**This problem is interactive.** You are given a positive integer $ N $ . Snuke secretly holds a permutation $ P=(P_1,P_2,\dots,P_N) $ of $ (1,2,\dots,N) $ and a sequence $ A=(A_1,A_2,\dots,A_N) $ of positive integers of length $ N $ . **It is guaranteed that $ P_1

N/A

N/A

### Input/Output This problem is interactive. First, $ N $ is given from Standard Input: > $ N $ Next, you may send at most $ 2N $ queries to Snuke. When sending a query by specifying two **distinct** positive integers $ s,t $ , output in the following format. Do not forget to include a newline at the end. > ? $ s $ $ t $ After sending a query, you will receive a response from Snuke in the following format: > $ X $ Here, $ X $ is an integer: - If $ X\ne -1 $ , then $ X $ is the value of $ \displaystyle \sum_{i=\min(P_s,P_t)}^{\max(P_s,P_t)}A_i $ . - If $ X=-1 $ , then either $ s,t $ do not satisfy the constraints or you have sent more than $ 2N $ queries. - In this case, your program is judged as incorrect and must terminate immediately. Once you have determined $ P $ and $ A $ , output your answer in the following format. This output does not count as a query. > ! $ P_1 $ $ P_2 $ $ \dots $ $ P_N $ $ A_1 $ $ A_2 $ $ \dots $ $ A_N $ **Note that $ P_1