Problem

Problem Description

HazelFan is given two positive integers a,b， and he wants to calculate amodb. But now he forgets the value of b and only remember the value of a, please tell him the number of different possible results.

 

Input

The first line contains a positive integer T(1≤T≤5), denoting the number of test cases.
For each test case:
A single line contains a positive integer a(1≤a≤109).

 

Output

For each test case:
A single line contains a nonnegative integer, denoting the answer.

 

Sample Input

213

 

Sample Output

23
分析：
找规律，两个一组，前两个输出2，之后输出3,4,5依次递增。
#include<bits/stdc++.h>using namespace std;int main(){    int t;    cin>>t;    while(t--)    {        long long a;        cin>>a;        if(a%2==0) cout<<a/2+1<<endl;        else cout<<(a+1)/2+1<<endl;    }    return 0;}