#include <iostream>

#include <cstdio>

#include <cmath>

#include <algorithm>

#include <vector>

#include <iomanip>

#include <cstring>

#include <map>

#include <queue>

#include <set>

#include <cassert>

#define mkp make_pair

using namespace std;

const double EPS=1e-;

const int SZ=,INF=0x7FFFFFFF;

typedef long long lon;

int arr[SZ];

bool chk(const vector<int> &vct,int mod)

{

    if(mod==||mod==||mod==)return ;

    else if(mod==||mod==)return (vct.size()-)%mod==;

    else if(mod==)return (vct.size()-)%==;

    else

    {

        int res=;

        for(int i=;i<vct.size();++i)

        {

            res=res*+vct[i];

            res%=mod;

        }

        return res==;

    }

}

int main()

{

    std::ios::sync_with_stdio();

    //freopen("d:\\1.txt","r",stdin);

    lon casenum;

    //cin>>casenum;

    //for(lon time=1;time<=casenum;++time)

    {

        int n;

        cin>>n;

        vector<int> vct(n,);

        for(int i=;i<;++i)

        {

            vct[n-]=i;

            if(chk(vct,i))arr[i]=;

        }

        int res=;

        for(int i=;i<;++i)

        {

            if(arr[i]&&arr[i+])++res;

        }

        cout<<res<<endl;

    }

    return ;

}