There are \(N\) people in a room. Your task is to find the number of ways to divide the people of the room into two groups \(A\) and \(B\), such that each group contains at least one member.
As the number of ways can be large, print output modulo \(10^{9}+7\).

Input format

• First line: \(T\) denoting the number of test cases
• Next \(T\) lines: \(N\) denoting the number of people in a room

Output format

For each test case, print the number of ways as modulo \(10^{9}+7\) in a new line.

Constraints

\(1 \le T \le 10^{5}\)
\(1 \le N \le 10^{9}\)