Carol Number
Submissions: 540   Accuracy:

22.42%

  Difficulty: Basic   Marks: 1

A Carol number is an integer of the form 4n – 2(n+1) – 1. Given a number n, the task is to find the n’th Carol Number. First few carol numbers are 1, 7, 47, 223, 959… etc.

Input:

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains the integer N.

Output:

Print the n'th carol number for each test case in a new line.


Constraints:

1<= T <=100

1<= N <=32


Example:

Input:

2

4

Output:

7

223

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Sujnesh Mishra
Author: sujnesh


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.