#include <cstdio>

#include <algorithm>

#include <cmath>

#include <cstring>

using namespace std;

double EPS=1e-10;

double add(double a,double b){

    if(abs(a+b)<EPS*(abs(a)+abs(b)))return 0;

    return a+b;

}

const int MAX_N=310;

struct P{

    double x,y;

    P(){}

    P(double x,double y):x(x),y(y){}

    P operator + (P p){return P(add(x,p.x),add(y,p.y));}

    P operator - (P p){return P(add(x,-p.x),add(y,-p.y));}

    P operator * (double d){return P(x*d,y*d);}

    double dot(P p){return add(x*p.x,y*p.y);} //点积

    double det(P p){return add(x*p.y,-y*p.x);}  //叉积

}ps[MAX_N];

double dist(P p,P q){return sqrt((p-q).dot(p-q));}

struct PolarAngle{

    double angle;

    bool flag;

}as[MAX_N];

bool cmp_a(PolarAngle a,PolarAngle b){

	return a.angle<b.angle;

}

int solve(int n,double r){

    int ans=1;

    for(int i=0;i<n;i++){

        int m=0; double d;

        for(int j=0;j<n;j++){

            if(i!=j&&(d=dist(ps[i],ps[j]))<=2*r){

                double phi=acos(d/2);

                double theta=atan2(ps[j].y-ps[i].y,ps[j].x-ps[i].x);

                as[m].angle=theta-phi,as[m++].flag=1;

                as[m].angle=theta+phi,as[m++].flag=0;

            }

        }sort(as,as+m,cmp_a);

        for(int sum=1,j=0;j<m;j++){

            if(as[j].flag)sum++;

            else sum--;

            ans=max(ans,sum);

        }

    }return ans;

}

int N;

int main(){

    while(scanf("%d",&N),N){

        for(int i=0;i<N;i++)scanf("%lf%lf",&ps[i].x,&ps[i].y);

        printf("%d\n",solve(N,1.0));

    }return 0;

}