#include <bits/stdc++.h>
using namespace std;
long long bin_pow(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) {
      res *= a;
      res %= 1000000000007;
    }
    a *= a;
    a %= 1000000000007;
    b >>= 1;
  }
  return (res % 1000000000007);
}
int main() {
  int n;
  cin >> n;
  vector<long long> pows(n + 1);
  pows[0] = 1;
  for (int i = 1; i <= n; i++) {
    pows[i] = pows[i - 1] * 2;
  }
  long long sum = 0;
  for (int i = 1; i <= n; i++) {
    sum += pows[i];
  }
  cout << sum;
  return 0;
}
