630C.md (821B)
1 Source: https://codeforces.com/problemset/problem/630/C 2 3 C. Lucky Numbers 4 5 time limit per test 6 7 0.5 seconds 8 9 memory limit per test 10 11 64 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 The numbers of all offices in the new building of the Tax Office of IT City will have lucky numbers. 22 23 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. 24 25 Input 26 27 The only line of input contains one integer *n* (1 ≤ *n* ≤ 55) — the maximum length of a number that a door-plate can hold. 28 29 Output 30 31 Output one integer — the maximum number of offices, than can have unique lucky numbers not longer than *n* digits. 32 33 Examples 34 35 Input 36 37 ``` 38 2 39 ``` 40 41 Output 42 43 ``` 44 6 45 ```