codeforces 411 div2-find amir

最新推荐文章于 2019-07-12 09:41:42 发布

一世倾安

最新推荐文章于 2019-07-12 09:41:42 发布

阅读量266

点赞数

分类专栏： codeforces 思维题目数论文章标签： codeforces

本文链接：https://blog.csdn.net/zdc_8023/article/details/78319866

版权

codeforces 思维题目同时被 2 个专栏收录

9 篇文章 0 订阅

订阅专栏

数论

4 篇文章 0 订阅

订阅专栏

Find Amir

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 ≤ 10⁵) — the number of schools.

Output

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

Examples

Input

Output

Input

Output

Note

In the first example we can buy a ticket between the schools that costs $\text{[math]}$ .

#include<cstdio>
#include<iostream>
using namespace std;
int main()
{
	int n;
	cin >> n;
	if (n % 2==0) {
		cout << n / 2 - 1 << endl;
	}
	else cout << (n - 1) / 2 << endl;
	return 0;
}