Associated Course(s):
Interview Preparation
Geeks Classes in Noida

Imagine you have a special keyboard with the following keys:

Key 1: Prints 'A' on screen

Key 2: (Ctrl-A): Select screen

Key 3: (Ctrl-C): Copy selection to buffer

Key 4: (Ctrl-V): Print buffer on screen appending it

after what has already been printed.

If you can only press the keyboard for N times (with the above four keys), write a program to produce maximum numbers of A's. That is to say, the input parameter is N (No. of keys that you can press), the output is M (No. of As that you can produce).

**Input:**

The first line of input contains an integer T denoting the number of test cases.

The first line of each test case is N,N is the number of key.

**Output:**

Print maximum number of A's. Print -1, if N is greater than 75.

**Constraints:**

1 ≤ T ≤ 50

1 ≤ N ≤ 75

**Example:**

**Input:**

2

3

7

**Output:**

3

9

**Explanation:**

Input: N = 3

Output: 3

We can at most get 3 A's on screen by pressing

following key sequence.

A, A, A

Input: N = 7

Output: 9

We can at most get 9 A's on screen by pressing

following key sequence.

A, A, A, Ctrl A, Ctrl C, Ctrl V, Ctrl V

blackshadows | 210 |

xmyqsh | 198 |

hanuman001 | 164 |

Adarsh Trivedi | 148 |

layman_brother | 144 |

blackshadows | 692 |

xmyqsh | 539 |

aman19 | 398 |

r0c2048 | 360 |

kspk | 331 |

akhayrutdinov | 5005 |

Ibrahim Nash | 4871 |

Quandray | 4338 |

sanjay05 | 3668 |

blackshadows | 3196 |

Login to report an issue on this page.