Total number of Strings
Submissions: 2969   Accuracy:

56.13%

  Difficulty: Basic   Marks: 1

Given 3 characters a, b, c. Find the number of strings of length n that can be formed from these 3 characters. Given that : we can use ‘a’ as many times as we want, ‘b’ maximum once, and ‘c’ maximum twice.

Input:
The first line of input contains an integer T denoting the number of test cases. The first and last line of each test case consists of an integer n

Output:
Print the total number of string that can be formed.

Constraints: 
1<=T<=20
1<=N<=20

Example:
Input:

2
3
5

Output:
19
71 

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

Contributor: Saksham Ashtputre
Author: saksham0751


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.