SOLVE

LATER

killjee and balloons

Problem

Editorial

Analytics

There are *n* ballons of different colors. killjee hates balloons and want to blast all of them but he can't as he is too lazy so he decided to blow odd number of balloons. He wants to know in how many ways he can select odd number of balloons to blast them.

As you all know killjee is too weak in maths please help him moreover killjee is so lazy that he wants the result modulo $$10^7+7$$.

** Input **

First line of input contains a single integer $$t$$ denoting number of test cases

each test case has a single integer $$n$$ as input

** Note **

Please use fast i/o i.e. scanf/printf in c++

**Output**

Print the answer of each test case in separate lines

**Constraints**

$$ t \le 5*10^6$$

$$ n \le 10^{18}$$

Time Limit:
3.0 sec(s)
for each input file.

Memory Limit:
256 MB

Source Limit:
1024 KB

Marking Scheme:
Marks are awarded when all the testcases pass.

Allowed Languages:
C,
C++,
C++14,
Clojure,
C#,
D,
Erlang,
F#,
Go,
Groovy,
Haskell,
Java,
Java 8,
JavaScript(Rhino),
JavaScript(Node.js),
Julia,
Kotlin,
Lisp,
Lisp (SBCL),
Lua,
Objective-C,
OCaml,
Octave,
Pascal,
Perl,
PHP,
Python,
Python 3,
R(RScript),
Racket,
Ruby,
Rust,
Scala,
Swift,
Visual Basic

Initializing Code Editor...

{"acac7f7": "/pagelets/suggested-problems/algorithm/find-the-power/", "2d0e7b7": "/pagelets/show-submission/algorithm/find-the-power/", "a4d0e8f": "/pagelets/problem-author-tester/algorithm/find-the-power/", "924b114": "/pagelets/recommended-problems/algorithm/find-the-power/", "1aa3824": "/pagelets/problems-hint/algorithm/find-the-power/"}

realtime.hackerearth.com

80

fc08c8d348d31d1a565c92f5e922673f40cc79b9

58a29e5cae2309f04b28

/realtime/pusher/auth/