An Odd Question

All submissions for this problem are available.
*Odd graph* is a graph having odd number of edges. You're given a [complete graph](https://en.wikipedia.org/wiki/Complete_graph) having $N$ nodes (numbered $1$ through $N$). You can convert this graph into an *odd graph* by removing a set of edges. Find the total number of ways to convert given graph into an *odd graph* $($modulo $10^9+7)$. **Note:** Two ways are considered different, if different set of edges are being deleted. ###Input  The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.  The first and only line of each test case contains single integer $N$. ###Output For each test case, print a single line denoting the answer. ###Constraints  $1 \leq T \leq 10^5$  $1 \leq N \leq 10^9$ ###Sample Input 2 2 3 ###Sample Output 1 4 ###Explanation **Example case 1:**  $\{\space \}  $Only one possible way is not to delete any edges. **Example case 2:** These are the four ways to make an *odd graph*.  $\{\space\}  $ Given graph is already an odd graph. No edges will be deleted.  $\{(1,2),(1,3)\}  $ Edges $(1,2)$ and $(1,3)$ will be deleted.  $\{(1,2),(2,3)\}  $ Edges $(1,2)$ and $(2,3)$ will be deleted.  $\{(1,3),(2,3)\}  $ Edges $(1,3)$ and $(2,3)$ will be deleted.Author:  akil_av17 
Tags  akil_av17 
Date Added:  5022019 
Time Limit:  1 sec 
Source Limit:  50000 Bytes 
Languages:  C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, kotlin, PERL6, TEXT, SCM chicken, PYP3, CLOJ, COB, FS 
Comments
 Please login at the top to post a comment.
SUCCESSFUL SUBMISSIONS
Fetching successful submissions