Problem Description

DIVCO has one square chip. He plans to cut this chip into smaller pieces and stack them to form a tower.

Specifically, DIVCO will repeat the following process \( N \) times to divide the chip:

• Each chip he currently has is divided into 4 equal parts, resulting in 4 smaller chips.

How many chips will DIVCO have after \( N \) processes?

Input Format

The input is given from the standard input in the following format:

\( N \)

Output Format

Output the number of chips after \( N \) processes.

Sample Input and Output

Sample Input #1

1

Sample Output #1

4

Sample Input #2

2

Sample Output #2

16

Notes/Hints

Constraints

• \( N \) is an integer between 1 and 5 inclusive.

Sample Explanation 1

After 1 process, the chip is divided into 4 pieces.

Sample Explanation 2

In the second process, each of the 4 chips obtained from the first process is divided into 4, resulting in a total of \( 4 \times 4 = 16 \) chips.

见题面 Input 部分

见题面 Output 部分