#include #include using namespace std; using namespace atcoder; using ll=int; using ld=long double; ld pie=3.141592653589793; ll inf=144494; ll mod=1000000007; ll x[100001],y[100001]; ll memo[20001][20001]; int main(){ ll n; cin >>n; for (ll i = 0; i < n; i++) { cin >> x[i]>> y[i]; } ll ans=0; for (ll i = 0; i < n; i++) { bool ok=true; for (ll j = max(x[i]-20,0); j <=min(x[i]+20,20000); j++) { ll xx=(x[i]-j)*(x[i]-j); for (ll k = y[i]; k <=min(y[i]+20,20000); k++) { ll z=xx+(y[i]-k)*(y[i]-k); if (z<400) { if (memo[j][k]==1) { ok=false; break; } }else{ break; } } ll zz=max(y[i]-20,0); for (ll k = y[i]-1; k >=zz; k--) { ll z=xx+(y[i]-k)*(y[i]-k); if (z<400) { if (memo[j][k]==1) { ok=false; break; } }else{ break; } } if (!ok) { break; } } if (ok) { memo[x[i]][y[i]]=1; ans+=1; } } cout << ans << endl; }