1833: Hands Shaking

内存限制:128 MB 时间限制:1.000 S
评测方式:文本比较 命题人:
提交:17 解决:6

题目描述

Consider a meeting of n businessmen sitting around a circular table. To start the meeting, they must shake hands. Each businessman shakes the hand of exactly one other businessman. All handshakes happen simultaneously. We say that the shake is perfect if no arms cross each other. Given an int n, return the number of perfect shakes that exist for n businessmen.

输入

Each case is a line containing a number n.n will be between 2 and 50,inclusive and n is even.

输出

please output the number of perfect shakes that exist fot n businessmen perline.

样例输入 复制

2
4
8

样例输出 复制

1
2
14