A. Mysterious strings

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Input

The input contains a single integer a (1 ≤ a ≤ 40).

Output

Output a single string.

Sample test(s)

input

2

output

Adams

input

8

output

Van Buren

input

29

output

Harding

解题说明：题目描述过于简单，看不懂该输出什么，只好参考别人代码，后来发现原来是输出美国历任总统，这题目真搞笑

#include <iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;

int main()
{
	int t;
	char s[40][40]={"Washington","Adams","Jefferson","Madison","Monroe","Adams","Jackson","Van Buren","Harrison","Tyler","Polk","Taylor","Fillmore","Pierce","Buchanan","Lincoln","Johnson","Grant","Hayes","Garfield","Arthur","Cleveland","Harrison","Cleveland","McKinley","Roosevelt","Taft","Wilson","Harding","Coolidge","Hoover","Roosevelt","Truman","Eisenhower","Kennedy","Johnson","Nixon","Ford","Carter","Reagan"};
	scanf("%d",&t);
	printf("%s\n",s[t-1]);
	return 0;
}