#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int maps[] = {
    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 n;
int main() {
  while (scanf("%d", &n) != EOF) {
    long long s = 1, e = 2;
    int m = maps[n - 1] - 1;
    while (m) {
      if (m & 1) s = s * e % mod;
      e = e * e % mod;
      m >>= 1;
    }
    cout << (s + mod - 1) % mod << endl;
  }
  return 0;
}
