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

#F1360. Lucky Numbers

  • ID: 1366
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:基础
  • 上传者:
  • 组合数学
  • 数学
  • 基础
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Lucky Numbers

题目描述

C. Lucky Numbers
time limit per test
0.5 seconds
memory limit per test
64 megabytes
input
standard input
output
standard output

The numbers of all offices in the new building of the Tax Office of IT City will have lucky numbers.

Lucky number is a number that consists of digits 7 and 8 only. Find the maximum number of offices in the new building of the Tax Office given that a door-plate can hold a number not longer than n digits.

Input

The only line of input contains one integer n (1≤n≤55) − the maximum length of a number that a door-plate can hold.

Output

Output one integer − the maximum number of offices, than can have unique lucky numbers not longer than n digits.

Examples
Input
2
Output
6

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