Painting Balls
Difficulty: Hard

Rahul once decided to paint things up to pass his time. Rahul had $N$ balls kept in a linear fashion all of them are initially not-colored. He has two types of paints _RED_ and _BLUE_. Now he wants to paint the balls such that there are *atmost* $2$ positions where a _RED_ colored ball touches a _BLUE_ colored ball. He has to always color all the balls.

Rahul wants to know in how many ways can he color all the ball. Write a program to answer his question.

**Input Format:**		

First line contains $T$, number of test cases.
Next $T$ lines each contain a single numbers $N$, representing the number of balls.

**Output Format:**

$T$ lines each having a single number representing the required answer.

**Constraints:**

$1 \le T \le 10^3$		
$1 \le N \le 10^5$


**Sample Input #00**  

    2
	1
	2
	
**Sample Output #00** 

    2
	4

**Explanation**		
_Sample #00:_		
_Case1:_ Possible ways to color are $\{\{R\},\{B\}\}$. So the answer is $2$.		
_Case2:_ Possible ways to color are $\{\{R,R\},\{B,B\},\{R,B\},\{B,R\}\}$. So the answer is $4$.
	

Input Format:

Output Format:

Sample Input:

Sample Output:

Python 3 starter code:


Reference solution (C++):
    #include <iostream>
    using namespace std;

    int main() 
    {
        long long n,t;
        cin>>t;
        while(t--)
            {
            cin>>n;
            cout<<2+ n*(n-1)<<endl;
        }
        return 0;
    }