#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int P[] = {2,       3,       5,        7,        13,      17,
                 19,      31,      61,       89,       107,     127,
                 521,     607,     1279,     2203,     2281,    3217,
                 4253,    4423,    9689,     9941,     11213,   19937,
                 21701,   23209,   44497,    86243,    110503,  132049,
                 216091,  756839,  859433,   1257787,  1398269, 2976221,
                 3021377, 6972593, 13466917, 20996011, 24036583};
long long expBySqr(long long x, long long n) {
  long long y = 1;
  for (; n != 0; n >>= 1) {
    if ((n & 1) == 1) {
      y = y * x % MOD;
    }
    x = x * x % MOD;
  }
  return y;
}
int main() {
  int n;
  scanf("%d", &n);
  int res = expBySqr(2LL, P[n - 1] - 1) % MOD;
  res = (res + MOD - 1) % MOD;
  printf("%d\n", res);
  return 0;
}
