#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int Mersenne[50] = {
    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, 24036583, 25964951, 30402457, 32582657};
long long quick_pow(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % mod;
    b >>= 1;
    a = (a * a) % mod;
  }
  return ans;
}
int main() {
  int n;
  cin >> n;
  cout << (quick_pow(2, Mersenne[n] - 1) - 1 + mod) % mod;
  return 0;
}
