#include <bits/stdc++.h>
const int mod = 1e9 + 7;
int n, ms[41] = {0,       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};
int ksm(int k) {
  int res = 1, I = 2;
  for (; k; k >>= 1, I = (long long)I * I % mod)
    if (k & 1) res = (long long)res * I % mod;
  return res;
}
int main() {
  std::cin >> n;
  std::cout << (ksm(ms[n] - 1) - 1 + mod) % mod;
  return 0;
}
