Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2) A. Splits 水题 题意+解析+ 答案

A. Splits

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Let's define a split of n as a nonincreasing sequence of positive integers, the sum of which is n.

For example, the following sequences are splits of 8: [4, 4], [3, 3, 2], [2, 2, 1, 1, 1, 1], [5, 2, 1].

The following sequences aren't splits of 8: [1, 7], [5, 4], [11,  - 3], [1, 1, 4, 1, 1].

The weight of a split is the number of elements in the split that are equal to the first element. For example, the weight of the split [1, 1, 1, 1, 1] is 5, the weight of the split [5, 5, 3, 3, 3] is 2 and the weight of the split [9] equals 1.

For a given n, find out the number of different weights of its splits.

Input

The first line contains one integer n (1 ≤ n ≤ 10⁹).

Output

Output one integer — the answer to the problem.

Examples

Input

Copy

7

Output

Copy

4

Input

Copy

8

Output

Copy

5

Input

Copy

9

Output

Copy

5

Note

In the first sample, there are following possible weights of splits of 7:

Weight 1: []

Weight 2: [, , 1]

Weight 3: [, , , 1]

Weight 7: [, , , , , , ]

思路：列举前几个数字会很有趣的发现ans=1+n/2(答案确实如此）

分析下原因：我们会发现对于任意数n至少有一个等于n的 Weight（分为n个1） 除此之外n所能达到最大 Weight为n/2,所以ans=1+n/2;

代码如下：

#include<bits/stdc++.h>

using namespace std;

int main()
{
    int n,ans=0;
    cin >> n;
    cout << n/2+1 << endl;
    return 0;
}