You are provided an unlimited collection of **red**, **green** and **blue** balls. Now your task is to arrange **N** balls taken from this collection in a line in such a way that **red** balls appear first, followed by **green** balls and then **blue** balls. Given a value of **N **you have to find the number of ways to do that.

**Note:**** ** In a particular arrangement a certain color of balls may be missing but the order must be strictly maintained with the available balls.

**Input **

The first line of the input contains **T**, the number of test cases. Then **T** lines follow. Each test case contains one line only containing the value of **N**.

**Output **

For each test case print the answer in a new line.

**Constraints**

1<=**T**<=100

1<=**N**<=10^9

**Example **

**Input**

2

1

2

**Output**

3

6

**Explanation**

**1.** For the first test case you are allowed to take 1 ball only. So that one ball can be red, green or blue. So the number of ways in this case is 3.

**2.** For the second test case you are allowed to take 2 balls. So you have six alternative arrangements ie. RG,GB,RB,RR,GG,BB.

Mr_Bean | 58 |

DhruvKulshreshtha | 53 |

Rishabh Jain 32 | 48 |

bharadwaju | 44 |

Johirul Islam | 41 |

Mr_Bean | 783 |

Dhirendra121 | 462 |

kinetic | 360 |

kevinyu102589 | 358 |

Guru_console | 326 |

akhayrutdinov | 4926 |

Ibrahim Nash | 4446 |

Quandray | 4261 |

sanjay05 | 3668 |

GB11 | 2857 |

Login to report an issue on this page.