SOLVE

LATER

Easy Question

Problem

Editorial

Analytics

This is the easiest question of the entire set. :D

Just find **6 ^{n}** and print last two digits.

*Note : Suppose if your answer is 06 then print just 6.*

**Input**

The first line of the input contains a single integer **T** *(1 ≤ T≤ 10^5)* — the number of test cases.

Each test case contains a single line containing single number **n**. *( 1 <= n <= 10^50 )*

**Output**

Print **T** lines. In each line print the desired output

**AUTHOR** : spaul100

Explanation

Case 1 : n = 1, 6^1 = 6, So answer is 6

Case 2 : n =3 , 6^3 = 216, So answer is 16

Time Limit:
1.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++,
Clojure,
C#,
D,
Erlang,
F#,
Go,
Groovy,
Haskell,
Java,
Java 8,
JavaScript(Rhino),
JavaScript(Node.js),
Lisp,
Lisp (SBCL),
Lua,
Objective-C,
OCaml,
Octave,
Pascal,
Perl,
PHP,
Python,
Python 3,
R(RScript),
Racket,
Ruby,
Rust,
Scala 2.11.8,
Swift,
Visual Basic

Initializing Code Editor...

{"2e0bd72": "/pagelets/problems-hint/algorithm/easy-question/", "2e0bd46": "/pagelets/suggested-problems/algorithm/easy-question/", "2e0bd5d": "/pagelets/problem-author-tester/algorithm/easy-question/", "2e0bd86": "/pagelets/recommended-problems/algorithm/easy-question/", "2e0bd1e": "/pagelets/show-submission/algorithm/easy-question/"}

{}

realtime.hackerearth.com

80

99a8536f7a85294a26fe8bb842a159bb4180c1b3

58a29e5cae2309f04b28

/realtime/pusher/auth/