#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
inline int qpow(int a, int n) {
  int ans = 1;
  while (n) {
    if (n & 1) ans = (long long)ans * a % mod;
    a = (long long)a * a % mod;
    n >>= 1;
  }
  return ans;
}
int biao[41] = {0,       1,       2,       4,       6,        12,      16,
                18,      30,      60,      88,      106,      126,     520,
                606,     1278,    2202,    2280,    3216,     4252,    4422,
                9688,    9940,    11212,   19936,   21700,    23208,   44496,
                86242,   110502,  132048,  216090,  756838,   859432,  1257786,
                1398268, 2976220, 3021376, 6972592, 13466916, 20996010};
int main() {
  int n;
  scanf("%d", &n);
  printf("%d\n", (qpow(2, biao[n]) + mod - 1) % mod);
  return 0;
}
