A. Greatest Convex codeforces solution in c++ || Codeforces Round #842 (Div. 2)

 A. Greatest Convex

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given an integer k$k$. Find the largest integer x$x$, where 1≤x<k$1\le x<k$, such that x!+(x−1)!†$x!+(x-1){!}^{†}$ is a multiple of ‡${}^{‡}$ k$k$, or determine that no such x$x$ exists.

†${}^{†}$ y!$y!$ denotes the factorial of y$y$, which is defined recursively as y!=y⋅(y−1)!$y!=y\cdot (y-1)!$ for y≥1$y\ge 1$ with the base case of 0!=1$0!=1$. For example, 5!=5⋅4⋅3⋅2⋅1⋅0!=120$5!=5\cdot 4\cdot 3\cdot 2\cdot 1\cdot 0!=120$.

‡${}^{‡}$ If a$a$ and b$b$ are integers, then a$a$ is a multiple of b$b$ if there exists an integer c$c$ such that a=b⋅c$a=b\cdot c$. For example, 10$10$ is a multiple of 5$5$ but 9$9$ is not a multiple of 6$6$.

Input

The first line contains a single integer t$t$ (1≤t≤104$1\le t\le {10}^4$) — the number of test cases. The description of test cases follows.

The only line of each test case contains a single integer k$k$ (2≤k≤109$2\le k\le {10}^9$).

Output

For each test case output a single integer — the largest possible integer x$x$ that satisfies the conditions above.

If no such x$x$ exists, output −1$-1$.

CODE OF THE QUESTION -------

  int n;

cin >>n;

cout<<n-1<<endl;