#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;


int main()
{
    int n;
    cin >> n;
    set<int> hash[20001];
    int ans = 0;
    int* x = new int[n];
    int* y = new int[n];
    rep(i,n)
    {
        cin >> x[i] >> y[i];
    }
    for (int i = 0; i < n; i++)
    {

        bool canSet = true;
        for (int j = max(0, x[i] - 19); j <= x[i] + 19 && j <= 20000; j++)
        {
            if (hash[j].size() != 0)
            {
                for (int k = min(0, y[i] - 19); k <= y[i] + 19 && k <= 20000; k++)
                {
                    if (hash[j].find(k) != hash[j].end())
                    {
                        if ((x[i] - j) * (x[i] - j) + (y[i] - k) * (y[i] - k) < 400)
                        {
                            canSet = false;
                            j = x[i] + 20 + 10;
                            k = y[i] + 20 + 10;
                        }
                    }
                }
            }

        }
        if (canSet)
        {
            hash[x[i]].insert(y[i]);
            ans = ans + 1;
        }
    }
    cout << ans;
    return 0;
}