Odd Language

pi pi pi pi pi pi pi pi pi pi pika pipi pi pipi pi pi pi pipi pi pi pi pi pi pi pi pipi pi pi pi pi pi pi pi pi pi pi pichu pichu pichu pichu ka chu pipi pipi pipi pipi pi pi pi pi pi pi pi pi pi pi pi pi pi pi pi pikachu pi pi pikachu ka ka ka ka ka ka ka ka pikachu pichu pichu pi pi pikachu pipi pipi pi pi pikachu ka ka ka ka ka ka ka ka ka pikachu pichu pichu pikachu pipi pipi ka ka pikachu pi pi pi pi pi pikachu ka ka pikachu pi pi pikachu pi pi pi pi pi pi pi pi pi pi pi pikachu ka pikachu

Input

The input is an integer $n$.

Output

Output a non-negative integer representing the answer.

Constraints

$1 \le n \le 100$

Example 1

Input

1

1

Example 2

Input

10

1