跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1354. Parking Lot

    ID: 1360 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 5 上传者: 标签>组合数学数学进阶难度共享题库Codeforces英文题面题目来源题面语言

Parking Lot

题目描述

I. Parking Lot
time limit per test
0.5 seconds
memory limit per test
64 megabytes
input
standard input
output
standard output

To quickly hire highly skilled specialists one of the new IT City companies made an unprecedented move. Every employee was granted a car, and an employee can choose one of four different car makes.

The parking lot before the office consists of one line of (2n-2) parking spaces. Unfortunately the total number of cars is greater than the parking lot capacity. Furthermore even amount of cars of each make is greater than the amount of parking spaces! That's why there are no free spaces on the parking lot ever.

Looking on the straight line of cars the company CEO thought that parking lot would be more beautiful if it contained exactly n successive cars of the same make. Help the CEO determine the number of ways to fill the parking lot this way.

Input

The only line of the input contains one integer n (3≤n≤30) − the amount of successive cars of the same make.

Output

Output one integer − the number of ways to fill the parking lot by cars of four makes using the described way.

Examples
Input
3
Output
24
Note

Let's denote car makes in the following way: A − Aston Martin, B − Bentley, M − Mercedes-Maybach, Z − Zaporozhets. For n=3 there are the following appropriate ways to fill the parking lot: AAAB AAAM AAAZ ABBB AMMM AZZZ BBBA BBBM BBBZ BAAA BMMM BZZZ MMMA MMMB MMMZ MAAA MBBB MZZZ ZZZA ZZZB ZZZM ZAAA ZBBB ZMMM

Originally it was planned to grant sport cars of Ferrari, Lamborghini, Maserati and Bugatti makes but this idea was renounced because it is impossible to drive these cars having small road clearance on the worn-down roads of IT City.


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 853 题。保留原作者与原赛事署名。