#include <bits/stdc++.h>
using namespace std;
int PP[] = {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, 37156667, 42643801, 43112609};
const int M = 1e9 + 7;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  int p = PP[n - 1] - 1;
  int ans = 1, p2 = 2;
  for (int i = 0; i < 30; i++) {
    if (p2 >= M) p2 -= M;
    if (p & (1 << i)) {
      ans = (1LL * ans * p2) % M;
    }
    p2 = (1LL * p2 * p2) % M;
  }
  cout << ans - 1 << endl;
}
