CF804A.Find Amir

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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.

输入格式

The first line contains a single integer $n$ ( $1<=n<=10^{5}$ ) — the number of schools.

输出格式

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

输入输出样例

输入#1
```
2
```
输出#1
```
0
```
输入#2
```
10
```
输出#2
```
4
```

说明/提示

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

首页