What’s up coders, today we are going to solve **Packaging Cupcakes CodeChef Solution** whose Problem code is **MUFFINS3**.

Contents

**Problem**

Now that Chef has finished baking and frosting his cupcakes, it’s time to package them. Chef hasÂ **N**Â cupcakes, and needs to decide how many cupcakes to place in each package. Each package must contain the same number of cupcakes. Chef will choose an integerÂ **A**Â between 1 andÂ **N**, inclusive, and place exactlyÂ **A**Â cupcakes into each package. Chef makes as many packages as possible. Chef then gets to eat the remaining cupcakes. Chef enjoys eating cupcakes very much. Help Chef choose the package sizeÂ **A**Â that will let him eat as many cupcakes as possible.

**Input**

Input begins with an integerÂ **T**, the number of test cases. Each test case consists of a single integerÂ **N**, the number of cupcakes.

**Output**

For each test case, output the package size that will maximize the number of leftover cupcakes. If multiple package sizes will result in the same number of leftover cupcakes, print the largest such size.

**Constraints**

**1 <= T <= 1000****2 <= N <= 100000000**

**Sample Input**

2 2 5

**Sample Output**

2 3

**Explanation**

In the first test case, there will be no leftover cupcakes regardless of the size Chef chooses, so he chooses the largest possible size. In the second test case, there will be 2 leftover cupcakes.

**Solution – Packaging Cupcakes – CodeChef Solution **

**Python 3**

#Solution Provided by CodingBroz T = int(input()) for i in range(T): n = int(input()) print((n // 2) + 1)

**Disclaimer:** The above Problem **(Packaging Cupcakes)** is generated by **CodeChef** but the Solution is provided by **CodingBroz**. This tutorial is only for **Educational** and **Learning** purpose.