FCTRL2 - Small factorials

You are asked to calculate factorials of some small positive integers.

Input

An integer t, 1 ≤ t ≤ 100, denoting the number of testcases, followed by t lines, each containing a single integer n, 1 ≤ n ≤ 100.

Output

For each integer n given at input, display a line with the value of n!

Example

Input:
4
1
2
5
3

Output:
1
2
120
6

Added by:adrian
Date:2004-05-28
Time limit:1s
Source limit:2000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All

hide comments
2016-10-29 08:48:34
the code worked correctly on ideone, still here it says "wrong answer". Why?
2016-10-09 15:47:22
I am getting the correct answer but still it's telling me it's wrong.(Not using println in the last line)
2016-09-27 04:46:28
Don't print new line in last
2016-09-20 17:42:48
for last input don't print new line ....


Last edit: 2016-09-20 17:43:16
2016-09-14 13:21:24
most worst site after submitting right answer showing compilation error...HAckerearth is much better
2016-08-30 18:54:03
nitish_garg503 , the code you have written, will genearate an output after each input, thus reason of wrong answer. Store them in array and display later, it will work.
2016-08-06 08:29:43
<snip> in java but it show wrong answer

Last edit: 2022-09-17 23:08:11
2016-07-27 16:46:12
Actually, I cant find what wrong wiith my code! :(
I already added newline or 0!=0 or 0!=1 ... but nothing change
any body give a help?
2016-07-16 03:10:12
Source limit 2000B is so strict.
My C++ Big integer library is about 10000B.
2016-07-06 07:55:13
Don't do it in python or java. If you do you won't learn anything new.
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.