#include <bits/stdc++.h>
using namespace std;
const double math_pi = 2 * acos(0.);
long long pp[41] = {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 binpow_mod(long long a, long long n, long long m) {
  long long res = 1;
  while (n) {
    if (n & 1) res *= a, res %= m;
    a *= a, a %= m, n >>= 1;
  }
  return res;
}
int main() {
  vector<long long> a;
  int k;
  for (int t = 0; t < 41; t++)
    a.push_back((binpow_mod(2, pp[t] - 1, 1000000007) + 1000000007 - 1) %
                1000000007);
  while (cin >> k) cout << a[k - 1] << endl;
  return 0;
}
