All Tracks Math Problem

Easy Question
Tag(s):

Very-Easy

Problem
Editorial
Analytics

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

Just find 6n 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

SAMPLE INPUT
2
1
3
SAMPLE OUTPUT
6
16
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, Scala 2.11.8, Swift, Visual Basic

CODE EDITOR

Initializing Code Editor...
Your Rating:

Contributor

Notifications
View All Notifications