{"raw_statement":[{"iden":"statement","content":"While the judges of TCPC were busy preparing the problems, they encountered a strange problem. One of the problems was missing !!\n\nThe judges remember that they prepared exactly N problems and that they were numbered from 1 to N. They also remembered that the problems were sorted according to their number.\n\nThe judges started investigating but they realized that they don't have enough time, so they asked the contestants for help.\n\nThe first line contains a single integer T, the number of test cases. \n\nThe first line of each test case consists of a single integer N (2 ≤ N ≤ 12), denoting the number of problems.\n\nThe second line of each test case contains N - 1 space separated integer denoting the number of each problem the judges didn't miss. Yet!\n\nit's guaranteed that the numbers are given in the increasing order.\n\nFor each test case print a single line, containing a single integer, denoting the number of the missing problem.\n\n"},{"iden":"input","content":"The first line contains a single integer T, the number of test cases. The first line of each test case consists of a single integer N (2 ≤ N ≤ 12), denoting the number of problems.The second line of each test case contains N - 1 space separated integer denoting the number of each problem the judges didn't miss. Yet!it's guaranteed that the numbers are given in the increasing order."},{"iden":"output","content":"For each test case print a single line, containing a single integer, denoting the number of the missing problem."}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ N \\in \\mathbb{Z} $ be the number of events, with $ 1 \\leq N \\leq 10^5 $.  \nLet $ p_i \\in \\mathbb{R} $ be the success probability for event $ i $, with $ 0 \\leq p_i \\leq 1 $ and at most 4 decimal digits.\n\n**Constraints**  \nEach $ p_i $ is given exactly (no rounding, truncation, or ceiling).\n\n**Objective**  \nFor each $ i \\in \\{1, \\dots, N\\} $, find the minimum positive integer $ n_i \\in \\mathbb{Z}^+ $ such that there exists an integer $ k_i \\in \\{0, 1, \\dots, n_i\\} $ satisfying:  \n$$\n\\frac{k_i}{n_i} = p_i\n$$","simple_statement":"Given N percentages (as decimals), find the minimum number of trials for each such that the success rate matches exactly.","has_page_source":false}