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 $\left[9\right]$ 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\le n\le {10}^9$).

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: [$\text{7}$]

Weight 2: [$\text{3}$, $\text{3}$, 1]

Weight 3: [$\text{2}$, $\text{2}$, $\text{2}$, 1]

Weight 7: [$\text{1}$, $\text{1}$, $\text{1}$, $\text{1}$, $\text{1}$, $\text{1}$, $\text{1}$]

题意：把一个数拆成非增的序列，拆分成的序列的权值是序列第一个数字的个数。

思路：任意一个数拆分成尽量多的2，比如7可以拆分成[2,2,2,1]，这是非全1的时候的最大权值，然后依次把2拆分成1就能使权值变小，即[2,2,1,1,1] [2,1,1,1,1,1]，再加上一个全1就是所求。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<iostream>
using namespace std;
int main()
{
    int n,i,ans;
    while(scanf("%d",&n)!=EOF)
    {

        printf("%d\n",(n/2)+1);
    }
    return 0;
}