#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <math.h>
using namespace std;

typedef pair<double,double> point;

double sq(double d){ return d*d; }

double dist(double x1,double y1,double x2,double y2)
{
  return sqrt(sq(x1-x2)+sq(y1-y2));
}

int intersect(point &pp,point &qq,
              double &cx1,double &cy1,
              double &cx2,double &cy2)
{
  double x1=pp.first,y1=pp.second,r1=1.0;
  double x2=qq.first,y2=qq.second,r2=1.0;

  double d=dist(x1,y1,x2,y2);
  double l,n,x,y,p,q;

  if ((d>r1+r2)||(d<fabs(r1-r2)))
    return 0;

  l=((r1*r1-r2*r2)/d+d)/2.0;

  n=sqrt(r1*r1-l*l);

  x=x1+(x2-x1)*l/d;
  y=y1+(y2-y1)*l/d;

  p=(y2-y1)*n/d;
  q=(x2-x1)*n/d;

  cx1=x+p;cx2=x-p;
  cy1=y-q;cy2=y+q;

  if (d==r1+r2) return 1;
  else return 2;
}

int solve(vector<point> &dat,double x,double y)
{
  int cnt=0;
  if (!(x>=0.0&&x<=10.0&&y>=0.0&&y<=10.0)) return 0;

  for (int i=0;i<dat.size();i++)
    if (dist(dat[i].first,dat[i].second,x,y)<=1.00001)
      cnt++;
  return cnt;
}

int main()
{
  for (;;){
    int n;
    cin>>n;
    if (n==0)
      break;

    vector<point> dat;
    while(n--){
      double x,y;
      cin>>x>>y;
      dat.push_back(make_pair(x,y));
    }

    int ans=1;
    for (int i=0;i<dat.size();i++){
      for (int j=i+1;j<dat.size();j++){
        double cx1,cy1,cx2,cy2;
        int num=intersect(dat[i],dat[j],cx1,cy1,cx2,cy2);
        if (num>=2) ans=max(ans,solve(dat,cx2,cy2));
        if (num>=1) ans=max(ans,solve(dat,cx1,cy1));
      }
    }
    cout<<ans<<endl;
  }
  return 0;
}