CodeForces 805C 思维

题意：有n个点，有一种从n点到m点的方式是花费（n+m）%(n+1)的代价；

           问：遍历完所有n个点的最小花费

思路：每次都选择mod(n+1)之后为0 的一对数字

           第一次是第一个和最后一个数字

           第二次是最后一个数字和第二个数字

           。。。。。。

           1->n->2->n-1->3->...->

           我们花费的值是总数的一半减去1

           也就是（n-1）/2

代码：

#include <bits/stdc++.h>
using namespace std;
int main(void)
{
    int n;
    scanf("%d",&n);
    printf("%d\n",(n-1)/2);
    return 0;
}

题目：

A few years ago Sajjad left his school and register to another one due to security reasons. Now he wishes to find Amir, one of his schoolmates and good friends.

There are n schools numerated from 1 to n. One can travel between each pair of them, to do so, he needs to buy a ticket. The ticker between schools i and j costs  and can be used multiple times. Help Sajjad to find the minimum cost he needs to pay for tickets to visit all schools. He can start and finish in any school.

Input

The first line contains a single integer n (1 ≤ n ≤ 105) — the number of schools.

Output

Print single integer: the minimum cost of tickets needed to visit all schools.

Examples

Input

2

Output

0

Input

10

Output

4

Note

In the first example we can buy a ticket between the schools that costs .