CodeForces-630C. Lucky Numbers

刺骨的言语ヽ痛彻心扉 2022-08-20 09:22 256阅读 0赞

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

  1. 2

output

  1. 6
  9. #include<stdio.h>
  10. #include<string.h>
  11. #include<algorithm>
  12. #include<cmath>
  13. using namespace std;
  14. long long map[100];
  15. int main()
  16. {
  17.     int n;
  18.     int i,j;
  19.     map[0]=0;
  20.     for(i=1;i<56;i++)
  21.     {
  22.         map[i]=map[i-1]+pow(2,i);
  23.     }
  24.     while(scanf("%d",&n)!=EOF)
  25.     {
  26.         printf("%lld\n",map[n]);
  27.     }
  28.     return 0;
  29. }

发表评论

表情：
评论列表 （有 0 条评论，256人围观）

还没有评论，来说两句吧...

相关阅读