#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ll long long
#define endl '\n'
using namespace std;
using namespace __gnu_pbds;

template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 2e5 + 7, P1 = 31, P2 = 37, mod = 1e9 + 7;

int mul(int a, int b) { return (1LL * a * b) % mod; }

int add(int a, int b) {
  a = (a + mod) % mod;
  b = (b + mod) % mod;
  return (a + b) % mod;
}

int fp(int b, int p) {
  if (b == 1 or p == 0) return 1;

  int ret = fp(b, p >> 1);
  ret = mul(ret, ret);

  if (p & 1) ret = mul(ret, b);

  return ret;
}

ll modInv(ll n) { return fp(n, mod - 2); }

ll fact[N], inv[N];

void pre() {
  fact[0] = inv[0] = 1;
  for (ll i = 1; i < N; i++)
    fact[i] = (fact[i - 1] * i) % mod, inv[i] = fp(fact[i], mod - 2);
}

ll nCr(ll n, ll r) { return ((fact[n] * inv[r]) % mod * inv[n - r]) % mod; }

ll nPr(ll n, ll r) { return ((fact[n] * inv[n - r])) % mod; }
int dp[1005][1005][2], tmp;
int solve(int last, int rem , int u ) {
  if (last == 1001) {
    return (!rem);
  }
  int &ret = dp[last][rem][u];
  if (~ret) return ret;
  ret = 0;
  // take
  if (last <= rem && last != tmp)
  ret = add(ret , solve( last , rem-last , 1));
  // leave
  if ( u  || last>= tmp)
  	ret = add(ret , solve(last+1  , rem , 0));
  return ret;
}
void doWork() {
  int n;
  cin >> n;
  tmp = 46;
  ll ans = 0;
  while (tmp > 0) {
    memset(dp, -1, sizeof dp);
    ans = add(ans, mul(solve(1, n,0), tmp));
    tmp--;
  }
  cout << ans << endl;
}

int main() {
  ios::sync_with_stdio(false);
  cout.tie(nullptr);
  cin.tie(nullptr);
  int t = 1;
  // cin >> t;
  while (t--) {
    doWork();
  }
  return 0;
}