#include<stdio.h>
#define dim 1024

//void solve();

long a[dim][4],n,i,j,cont;

int main()
{
	freopen("puteri.in","r",stdin);
	freopen("puteri.out","w",stdout);

	scanf("%ld",&n);
       //	solve();
       printf("%ld",n/2+1);


	return 0;
}

/*void solve()
{
	scanf("%ld",&n);
	for(i=1;i<=n;i++)
	{
		scanf("%ld%ld%ld",&a[i][1],&a[i][2],&a[i][3]);
		printf("%ld %ld %ld\n",a[i][1],a[i][2],a[i][3]);
	}
	for(i=1;i<n;i++)
		for(j=i+1;j<=n;j++)
		{
			if((!a[j][1]+a[i][1] || a[i][1]+a[j][1]%2==0) && (a[j][2]+a[i][2]%2==0 || !a[j][2]+a[i][2]%2) && (a[j][3]+a[i][3]%2==0 || !a[j][3]+a[i][3]))
			 cont++;
			else if(a[i][1]+a[j][1]==a[i][2]+a[j][2] && a[i][1]+a[j][1]==a[i][3]+a[j][3])
				cont++;
		}
       printf("%ld",cont);
} */