#include <bits/stdc++.h>

using namespace std;

#define REP(i, n)   for(int i = 0; i < (n); i++)
#define REPS(i, n)  for(int i = 1; i <= (n); i++)
#define RREP(i, n)  for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define mp make_pair
#define mt make_tuple
#define pb push_back

using ll  = long long;
using pi  = pair<int, int>;
using pl  = pair<ll, ll>;
using vi  = vector<int>;
using vl  = vector<ll>;
using vs  = vector<string>;
using vb  = vector<bool>;
using vvi = vector<vi>;
using vvl = vector<vl>;

const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const ll  INFL = 1e18;
const double PI = 3.141592653589793;
const double EPS = 1e-9;

template<class T> bool chmax(T &a, const T &b) { if(a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if(a > b) { a = b; return true; } return false; }

signed main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    ll N; cin >> N;

    vl factor(N+1);
    for(ll i = 2; i <= N; i++)
    {
        ll tmp = i;
        for(ll j = 2; j * j <= i; j++)
        {
            while(tmp % j == 0)
            {
                factor[j]++;
                tmp /= j;
            }
        }
        if(tmp != 1) factor[tmp]++;
    }

    ll ans = 1;
    REP(i, (int)factor.size())
    {
        ans *= factor[i] + 1;
        ans %= MOD;
    }
    cout << ans << endl;
}

#include <iostream>
#include <bits/stdc++.h>
#include <math.h>

using namespace std;

int main(){
    string s;
    cin>>s;
    string ans="Yes";
    for(int i=0;i<s.size();i+=2){
        if(s.size()%2==1){
            ans="No";
            break;
        }
        if(s.at(i)!='h' || s.at(i+1)!='i'){
            ans="No";
            break;
        }
    }
    
    cout<<ans<<endl;
    
    return 0;
}
