Go: package main

import (
	"fmt"
	"strconv"
)

func main() {
	for _, leftValue := range MultiplicationTableNum(9) {
		for _, rightValue := range MultiplicationTableNum(9) {
			strLeftVal, strRightVal, strMulti := strconv.Itoa(leftValue), strconv.Itoa(rightValue), strconv.Itoa(Multiplication(leftValue, rightValue))
			fmt.Println(strLeftVal + "x" + strRightVal + "=" + strMulti)
		}
	}
}

func MultiplicationTableNum(num int) []int {
	multiNum := []int{}
	for i := 1; i <= num; i++ {
		multiNum = append(multiNum, i)
	}
	return multiNum
}

func Multiplication(x, y int) int {
	return x * y
}

C++: #include <iostream>


using namespace std;

int main() {

	int i, j;

	for (i = 1; i <= 9; i++) {

		for (j = 1; j <= 9; j++) {

			cout << i << "x" << j << "=" << i*j << "\n";

		}

	}

	rewind(stdin);
	getchar();

	return 0;

}

C++: #include<iostream>

int main(){                                                                                 
  for(int i = 1; i <= 9; ++i){                                                              
    for(int j = 1; j <= 9; ++j){                                                            
      std::cout << i << "x" << j << "=" << i*j << std::endl;                                
    }                                                                                       
  }                                                                                         
  return 0;                                                                                 
}

C++: #include<bits/stdc++.h>
using namespace std;

int main(){
    for(int i=1;i<10;i++){
        for(int j=1;j<10;j++){
            cout<<i<<"x"<<j<<"="<<i*j<<endl;
        }
    }
    return(0);
}

C++: #include<stdio.h>

int main(){

	for(int a=1; a<=9; a++){
		for(int b=1; b<=9; b++){
			printf("%d*%d=%d\n",a,b,a*b);
		}
	}
    return 0;
}

C++: #include <stdio.h>

int i, j;

int main(void)
{
  for(i = 1; i <= 9; i++)
  for(j = 1; j <= 9; j++)
    printf("%dx%d=%d\n",i,j,i*j);
  return 0;
}

C++: - submit, private

C++: #include <iostream>
using namespace std;
int main(void){
    // Here your code !
    int count =10;
    int i,j,r;

for (i = 1; i < count; i++) {
    for (j = 1; j < count; j++) {
        r=i*j;
     cout<<"ixj=r"<<"\n";
    }
}


}

C++: #include<iostream>
using namespace std;
int main()
{
int i,j;
for(i=1;i<10;i++)
for(j=1;j<10;j++)
cout<<i<<'*'<<j<<'='<<i*j<<endl;
return 0;
}

C++: #include <iostream>
using namespace std;

int main()
{
	for (int i = 1; i < 10; i++) {
		for (int j = 1; j < 10; j++) {
			cout << i << 'x' << j << '=' << i * j << endl;
		}
	}
	return 0;
}

C++: #include <stdio.h>
int main()
{
for(int i=1;i<=9;++i)for(int j=1;j<=9;++j)printf("%dx%d",i,j,i*j);
}

C++: #include <iostream>
#include <string>
#include <cstring>
#include <fstream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <list>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <bitset>
#include <functional>

using namespace std;

#define FOR(i,n) 		for(int(i)=0;(i)<(int)(n);(i)++)
#define FORN(i,a,b,c) 	for(int(i)=a;i<(int)(b);i+=(c))
#define RES(x,nilai)	memset(x,nilai,sizeof(x));
#define pb              push_back
#define mp              make_pair
#define INF				1000000000

typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;

inline string IS(int a){
    char x[100];
    sprintf(x,"%d",a); string s = x;
    return s;
}

inline int SI(string a){
    char x[100]; int res;
    strcpy(x,a.c_str()); sscanf(x,"%d",&res);
    return res;
}

//==============================================

bool cmp(int x,int y) {return x>y;}

int main() {
	//freopen("in.txt","r",stdin);
	//freopen("13.txt","w",stdout);
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	
	for(int i =1; i <=9;i++) {
        for(int j =1; j<=9;j++) {
cout << i << 'x' << j << '=' << i*j << endl;
}
        }
		
    return 0;
}

C++: #include<iostream>
#include<stdio.h>
using namespace std;

int main(){
	int i,j;

	for(i = 1;i < 10;i++){
		for(j = 1;j < 10;j++){
			printf("%dx%d=%d\n",i,j,i*j);
		}
	}
	
    return 0;
}

C++: #include<iostream>
using namespace std;

int main()
{
	for(int i = 1;i < 10;i++)
	{
		for(int m = 1;m < 10;m++)
		{
			std::cout << i << "x" << m << "=" << i*m << std::endl;
		}
	}
    return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
	int a,b,r;
	for(a=0;a<10;++a){
		for(b=0;b<10;++b){
			r = a*b;
			cout << a<<"x"<<b << " = " << r<< endl;
		}
	}
return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define lli long long int

int main () {

	for(int i=1;i<10;i++){
		for(int j=1;j<10;j++){
			printf("%dx%d=%d\n",i,j,i*j);
		}
	}
    return 0;
}

C++: #include <iostream>
 
int main(){
    for(int i = 1; i < 10; ++i){
        for(int j = 1; j < 10; ++j){
            std::cout << i << "x" << j << "=" << i*j << std::endl;
        }
    }
    return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i,l,n) for(int i=l;i<n;i++)
#define rer(i,l,n) for(int i=l;i<=n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pii;

int main(){
	rep(i,1,10){
		rep(j,1,10){
			cout<<i<<'x'<<j<<'='<<i*j<<endl;
		}
	}
	
}

C++: #include<iostream>
using namespace std;
int main(){
	for(int i=1; i<10; i++){
		for(int l=1; l<10; l++){
			cout<<i<<"x"<<l<<"="<<i*l<<endl;
		}
	}
	return 0;
}

C++: #include<iostream>
using namespace std;

int main(){
for(int i=0;i<9;i++){
for(int j=0;j<9;j++){
cout << i+1 << "x" << j+1 << "=" << (i+1)*(j+1) << endl;
}
}
    return 0;
}

C++: #include<iostream>
using namespace std;

int main(){

 for(int i=1; i <= 9; i++){
  for(int j=1;j <= 9; j++){
   cout << i << "x" << j << "=" << i*j <<endl;
  }
 }
    return 0;
}

C++: #include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define FI first
#define SE second
#define MP make_pair
using namespace std;
const double EPS = 1e-8;
const int MAXN = 205;
const int INF = 1111111111;
const double PI = acos(-1.0);
inline int dcmp(double x)
{
	if(fabs(x)<EPS) return 0;
	return x<0?-1:1;
}
inline double sqr(double x){return x*x;}
struct Point{
	double x,y;
	Point(){}
	Point(double a,double b):x(a),y(b){}
	Point operator+(const Point&a)const{return Point(x+a.x,y+a.y);}
	Point operator-(const Point&a)const{return Point(x-a.x,y-a.y);}
	void input(){scanf("%lf%lf",&x,&y);}
}c[MAXN];

int solve(double r,int n)
{
	vector<pair<double,int> > v;
	int ret = 1,s;
	for(int i = 0; i < n; i++)
	{
		v.clear();
		v.push_back(MP(-PI,1));
		v.push_back(MP(PI,-1));
		for(int j = 0; j < n; j++)
		{
			if(i==j) continue;
			Point q = c[j]-c[i];
			double ab = sqrt(q.x*q.x+q.y*q.y),ac = r,bc = r;
			if(dcmp(ab+ac-bc)<=0)
			{
				v.push_back(MP(-PI,1));
				v.push_back(MP(PI,-1));
				continue;
			}
			if(dcmp(ab+bc-ac)<=0||dcmp(ab-ac-bc)>0)
				continue;
			double th = atan2(q.y,q.x);
			double fai = acos((sqr(ac)+sqr(ab)-sqr(bc))/(2*ac*ab));
			double a0 = th-fai,a1 = th+fai;
			if(dcmp(a0+PI)<0) a0+=2*PI;
			if(dcmp(a1-PI)>0) a1-=2*PI;
			if(dcmp(a0-a1)>0)
			{
				v.push_back(MP(a0,1));
				v.push_back(MP(PI,-1));
				v.push_back(MP(-PI,1));
				v.push_back(MP(a1,-1));
			}
			else
			{
				v.push_back(MP(a0,1));
				v.push_back(MP(a1,-1));
			}
		}
		sort(v.begin(),v.end());
		s = 1;
		for(int j = 0;j<v.size(); j++)
		{
			s+=v[j].SE;
			ret = max(ret,s);
		}
	}
	return ret;
}
int main()
{
	freopen("/home/qitaishui/code/in.txt","r",stdin);
	int n;
	double r1,r2;
	while(scanf("%d",&n)!=EOF)
	{
		for(int i = 0; i < n; i++)
			c[i].input();
		scanf("%lf%lf",&r1,&r2);
		printf("%d\n",solve(r1-r2,n));
	}
	return 0;
}