#include "bits/stdc++.h"
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll =long long;
using P =pair<int,int>;

int main(){
    int n;
    cin >> n;
    string s,sf,sl;
    vector <int> m(n,0);
    cout << 0 << endl;
    cin >> s;
    if(s=="Vacant"){
        exit(0);

    }
    else{
        /*if(s=="Male"){
            m[0]=1;
        }
        else{
            m[0]=-1;
        }*/
        sf=s;
    

    cout << n-1 << endl;
    cin >> s;
    if(s=="Vacant"){
        exit(0);
    }
    else{
        /*if(s=="Male"){
            m[n-1]=1;
        }
        else{
            m[n-1]=-1;
        }*/

        sl=s;


        int mi,r,l;
        r=n-1;
        l=0;
        while(r-l!=1){
            mi=(r+l)/2;
            cout << mi << endl;
            cin >> s;
            if(s=="Vacant"){
                exit(0);
        
                //break;
            }
            else{
                if(s==sf){
                    if((mi-l)%2==0){
                        l=mi;
                    }
                    else{
                        r=mi+1;
                    }
                }
                else{
                    if((mi-l)%2==0){
                        r=mi;
                    }
                    else{
                        l=mi-1;
                    }
                    
                }
            }
        }

    }

    

    }
    
    

    return 0;
}
#include <bits/stdc++.h>
#define ri register
#define int long long
#define E (n+1)
using namespace std; const int N=210, Mod=1e9+7;
inline int read()
{
    int s=0, w=1; ri char ch=getchar();
    while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
    while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
    return s*w;
}
int n,res;
map<int,int> Q;
signed main()
{
    n=read();
    for(ri int i=2;i<=n;i++)
    {
        int x=i;
        for(ri int j=2;j*j<=x;j++)
        {
            if(x%j) continue;
            while(x%j==0) Q[j]++, x/=j;
        }
        if(x>1) Q[x]++;
    }
    res=1;
    for(ri map<int,int>::iterator s=Q.begin();s!=Q.end();s++)
        res=res*(s->second+1)%Mod;
    printf("%lld\n",res);
    return 0;
}