codeforces 804A——Find Amir_codeforce 804a-优快云博客

本文介绍了一个简单的贪心算法问题，主人公Sajjad为了寻找好友Amir，需要访问所有学校，文章提供了求解最小花费的方法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

简单贪心。首先学校i和学校n+1-i肯定是免费的，那么两两成对，而相邻两队的价格为1，所以分奇偶讨论一下即可

#include<cstdio>
#include<cstring>
#include<queue>
#include <cstdlib>
#include<map>
#include <set>
#include <queue>
#include <iostream>
using namespace std;
const int MAXN = 1000010;
long long INF = 0x7fffffffffffffff;

int main() {
	int n;
	cin >> n;
	if (n % 2 == 0) {
		cout << n / 2 - 1<< endl;
	}
	else {
		cout << n / 2 << endl;
	}
}