Given a length n, count the number of strings of length n that can be made using ‘a’, ‘b’ and ‘c’ with at-most one ‘b’ and two ‘c’s allowed.

**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 an integer N denoting the length of the string.

**Output:**

Output the count of the strings that can be formed under the given constraint.

**Constraints:**

1<= T <=100

1<= N <=1000

**Example:**

Input:

2

1

3

Output:

3

19

**Explanation:
Test Case 1: **N = 1

Possible strings are: "a", "b" and "c"

**Test Case 2: **N = 3

Number of strings with 3 occurrances of a: 1

2-a and 1-b: 3

2-a and 1-c: 3

1-a, 1-b and 1-c: 6

1-a and 2-c: 3

1-b and 2-c: 3

Hence, total number of strings of length 3 = 1 + 3 + 3 + 6 + 3 + 3 = 19

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.

SumitSingh27 | 72 |

SanketAgarwal1 | 54 |

rathiarpit29 | 52 |

ujjwalsoni1999 | 52 |

vishalkumar61 | 50 |

SumitSingh27 | 398 |

saiujwal13083 | 279 |

ujjwalsoni1999 | 277 |

NaveenKumarNakka | 275 |

_maverick7_ | 266 |

blackshadows | 5362 |

Ibrahim Nash | 5242 |

akhayrutdinov | 5111 |

mb1973 | 4931 |

Quandray | 4598 |

Login to report an issue on this page.