2317: Cake Partition
内存限制：128 MB
时间限制：1.000 S
评测方式：文本比较
命题人：
提交：290
解决：49
题目描述
As we know,the BUCT ACM Summer Training is coming.So our dear Liu Sir bought a big cake yesterday.He has a Big Knife.He wants to use this knife to cut the cake into peices and then gives them to our dear acmers.But the knife can only be used n times.Liu Sir wants to know How Many Parts He Can Get Most.
输入
There are multiple cases.
Each case has a number n, indicates the times the knife can be used.(0<n<=106)
输出
A number in one line,indicates How Many Parts Liu Sir Can Get Most.
样例输入 复制
1
2
3
样例输出 复制
2
4
7
提示
There are large amounts of input ,so "scanf" and "printf" are recommended.