ABC198 —— A - Div - Problem

Problem9754--ABC198 —— A - Div

9754: ABC198 —— A - Div

_{[Creator : ]}

Time Limit : 1.000 sec Memory Limit : 512 MiB

Submit Solved: 1 Submit Num: 1 Statistics ShowOff!

Description

Two boys, A and B, will share $N$ indistinguishable sweets. How many ways are there to do this so that each boy gets a positive integer number of sweets?

Input

Input is given from Standard Input in the following format:

```
$N$
```

Output

Print the answer as an integer.

Constraints

- $N$ is an integer.
- $ 1 \leq N \leq 15$

Sample 1 Input

Sample 1 Output

There is only one way to share the sweets: A and B get one sweet each.

Sample 2 Input

Sample 2 Output

Sample 3 Input

Sample 3 Output

Source/Category

Submit

9754: ABC198 —— A - Div

Description

Input

Output

Constraints

Sample 1 Input Copy

Sample 1 Output Copy

Sample 2 Input Copy

Sample 2 Output Copy

Sample 3 Input Copy