#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
//#define int long long
#include "trilib.h"
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<bool> vb;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<pll> vll;
typedef tree<pii,null_type,less<pii>,rb_tree_tag,
tree_order_statistics_node_update> oset;
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mid (l+r)/2
#define all(x) x.begin(),x.end()
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;
#define sp <<" "<<
#define DEBUG(x) cout<<(#x) sp x<<endl
#define carp(a,b) (((a%MOD)*(b%MOD))%MOD)
#define topla(a,b) (((a%MOD)+(b%MOD))%MOD)
const ll INF=1e18;
const int MAXN=92;//1e5+5;
const int MAXNN=2e5+5;
const int MOD=1e9+7;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n=get_n();
if(n==3) give_answer(3);
else{
int say=0;
vb used(n+1,false);
FORE(bir,1,n+1){
int iki;
FORE(j,1,n+1){
if(j!=bir) {iki=j;break;}
}
FORE(j,1,n+1){
if(bir==j or iki==j) continue;
if(!is_clockwise(bir,iki,j)){
iki=j;
}
}
bool f=true;
FORE(j,1,n+1){
if(bir==j or iki==j) continue;
if(!is_clockwise(bir,iki,j)) {f=false; break;}
}
if(f) used[bir]=f;
}
FORE(i,1,n+1) if(used[i]) {say++;}
give_answer(say);
}
}
