The Monster and the Squirrel

题意翻译

### 题目概要 有一个正n多边形，每个顶点从1到n标号，从顶点1开始，向每个顶点的方向上绘制一条线。线到达顶点或与之前绘制的另一条线相交时停止。你需要经过所有线划分成的区域，当你在一个区域时，当且仅当另一个区域与你所在的区域共边时，你才能到这个区域，求你最少需要穿过几次所画的线。 ### 输入格式 一个整数，表示n。 ### 输出格式 一个整数，表示最少穿过画的线的次数。

题目描述

Ari the monster always wakes up very early with the first ray of the sun and the first thing she does is feeding her squirrel. Ari draws a regular convex polygon on the floor and numbers it's vertices $ 1,2,...,n $ in clockwise order. Then starting from the vertex $ 1 $ she draws a ray in the direction of each other vertex. The ray stops when it reaches a vertex or intersects with another ray drawn before. Ari repeats this process for vertex $ 2,3,...,n $ (in this particular order). And then she puts a walnut in each region inside the polygon. Ada the squirrel wants to collect all the walnuts, but she is not allowed to step on the lines drawn by Ari. That means Ada have to perform a small jump if she wants to go from one region to another. Ada can jump from one region P to another region Q if and only if P and Q share a side or a corner. Assuming that Ada starts from outside of the picture, what is the minimum number of jumps she has to perform in order to collect all the walnuts?

输入输出格式

输入格式

The first and only line of the input contains a single integer $ n $ ( $ 3<=n<=54321 $ ) - the number of vertices of the regular polygon drawn by Ari.

输出格式

Print the minimum number of jumps Ada should make to collect all the walnuts. Note, that she doesn't need to leave the polygon after.

输入输出样例

输入样例 #1

5

输出样例 #1

9

输入样例 #2

3

输出样例 #2

1

说明

One of the possible solutions for the first sample is shown on the picture above.

题意翻译

### 题目概要 有一个正n多边形，每个顶点从1到n标号，从顶点1开始，向每个顶点的方向上绘制一条线。线到达顶点或与之前绘制的另一条线相交时停止。你需要经过所有线划分成的区域，当你在一个区域时，当且仅当另一个区域与你所在的区域共边时，你才能到这个区域，求你最少需要穿过几次所画的线。 ### 输入格式 一个整数，表示n。 ### 输出格式 一个整数，表示最少穿过画的线的次数。