Go: package main

import "fmt"

func main() {
        for i := 1; i < 10; i++ {
                for j := 1; j < 10; j++ {
                        fmt.Printf("%dx%d=%d\n", i, j, i*j)
                }
        }
}

C++: #include <iostream>
#include <vector>
#include <fstream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <ctime>
#include <iterator>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;


int main()
{
    for(int c=1;c<=9;c++)
    {
        for(int c2=1;c2<=9;c2++)
        {
            cout<<c<<"x"<<c2<<"="<<c*c2<<endl;
        }
    }
}

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

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 <cstdlib>
using namespace std;

int main(){
	int k = strtol("1000000000000", 0, 10);
	return k == -2147483648;
}

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<iostream>
using namespace std;

int main(){
	for (int i=1;i<=9;i++)
	{
		cout<<i<<'x'<<i<<'='<<i*i;
		/*if (i!=9)*/cout<<endl;
	}
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
signed main(){
for(int i=1;i<=9;i++){
    for(int j=1;j<=9;j++){
        cout<<i<<"x"<<j<<"="<<i*j<<"\n";
    }
}
}

C++: #include<stdio.h>
#include<string.h>
#include<math.h>
#include<ctype.h>

int main()
{
   printf("1x1=1\n1x2=2\n.\n.\n9x8=72\n9x9=81");

    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 << "*" << j << "=" << i*j << endl;
	}
	return 0;
}

C++: #include <stdio.h>

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

    return 0;
}

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

int f(int x, int y){
	cout << x << "x" << y << "=" << x*y << endl;
	return 0;
}

int main(){
	int i;
	int j;
	for(i = 1; i < 10; i++){
		for(j = 1; j < 10; j++){
			f(i, j);
		}
	}
	return 0;
}

C++: #include <iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
const int maxn = 1023;
const int maxe = 800000;
/*************荳?握蝗セ蛹ケ驟肴ィ。譚ソ**********************/

int first[maxn],nxt[maxe],E[maxe],M;
int all, match[maxn];//all陦ィ遉コ蝗セ荳顔噪諤サ轤ケ謨ー,match陦ィ遉コ豈丈クェ轤ケ逧?嘗荳?クェ蛹ケ驟咲せ?育せ逧??蜿キ莉?蛻ーn, 蟷カ荳蚤ll>n ,蜈カ螳樔ケ溷庄莉・莉?蛻ーn-1荵溯。鯉シ?
int que[maxn], pre[maxn], base[maxn];
bool ha[maxn];
bool blossom[maxn];
void init(int n) {
   
	memset(first,-1,sizeof(first));
	M=-1;
	//all = n+1;//荳矩擇蜉?セケ逧?慮蛟吝庄莉・譖エ譁ー豁、蛟シ?梧園莉・邇ー蝨ィ荳咲畑譖エ譁ー
}
void _insert(int u,int v)
{
	M++;
	nxt[M]=first[u];
	first[u]=M;
	E[M]=v;
}
void insert( int u, int v) {
	if(max(u, v) + 1 > all) all = max(u, v) + 1;//閾ェ蜉ィ譖エ譁ー譛?、ァ蛟シ
   
	_insert(u,v);
	_insert(v,u);
}


void argument(int u) {
	while (u != -1) {
		int v = pre[u];
		int k = match[v];
		match[u] = v;
		match[v] = u;
		u = k;
	}
}
void changeblossom(int b, int u) {
	while (base[u] != b) {
		int v = match[u];
		blossom[base[v]] = blossom[base[u]] = true;
		u = pre[v];
		if (base[u] != b) {
			pre[u] = v;
		}
	}
}
int findbase(int u, int v) {
	bool in_path[maxn] = {};
	while (true) {
		in_path[u] = true;
		if (match[u] == -1) {
			break;
		}
		u = base[pre[match[u]]];
	}
	while (!in_path[v]) {
		v = base[pre[match[v]]];
	}
	return v;
}
int contract(int u, int v) {
	memset(blossom, 0, sizeof(blossom));
	int b = findbase(base[u], base[v]);
	changeblossom(b, u);
	changeblossom(b, v);
	if (base[u] != b) {
		pre[u] = v;
	}
	if (base[v] != b) {
		pre[v] = u;
	}
	return b;
}
int bfs(int p) {
	memset(pre, -1, sizeof(pre));
	memset(ha, 0, sizeof(ha));
	for (int i = 0; i <= all; ++i) {
		base[i] = i;
	}
	que[0] = p;
	ha[p] = 1;
	for (int s = 0, t = 1; s < t; ++s) {
		int u = que[s],v;
		for(int e=first[u]; e!=-1; e=nxt[e])
		{
			v=E[e];
			if ( base[u] != base[v] && v != match[u]) {
				if (v == p || (match[v] != -1 && pre[match[v]] != -1)) {
					int b = contract(u, v);
					for (int i = 0; i <= all; ++i) {
						if (blossom[base[i]]) {
							base[i] = b;
							if (ha[i] == 0) {
								ha[i] = 1;
								que[t++] = i;
							}
						}
					}
				} else if (pre[v] == -1) {
					pre[v] = u;
					if (match[v] == -1) {
						argument(v);
						return 1;
					} else {
						que[t++] = match[v];
						ha[match[v]] = 1;
					}
				}
			}
		}
	}
	return 0;
}

int max_match() {//霑泌屓譛?、ァ蛹ケ驟肴焚逶ョ
	memset(match, -1, sizeof(match));
	int ans = 0;
	for (int i = 0; i <= all; ++i) {
		if (match[i] == -1) {
			ans += bfs(i);
		}
	}
	return ans;
}
/*************荳?握蝗セ蛹ケ驟肴ィ。譚ソ**********************/

struct node
{
	int x,y;
	node(){}
	node(int aa,int bb){x=aa; y=bb;}
}vc[maxn];
int l;
int ok(node a,node b)
{
	int w=(int)fabs(a.x-b.x)+(int)fabs(a.y-b.y);
	return w<=l;
}
int main ()
{
	int i,j;
	//freopen("in.txt","r",stdin);
	int g[40][40],id=0;;
	for(i=0; i<=30; i++)
	for(j=0; j<=30;j++)
		g[i][j]=id++;
	
	int n, a, b;
	
	while(scanf("%d", &n)!=EOF)
	{
	/*************荳?握蝗セ蛹ケ驟肴ィ。譚ソ**********************/
		init();
	/*************荳?握蝗セ蛹ケ驟肴ィ。譚ソ**********************/
		for(i=0; i<n; i++)
		{
			scanf("%d%d", &a, &b);
			vc[i]=node(a,b);
		}
		scanf("%d",&l);
		for(i=0; i<n; i++)
		{
			for(j=0; j<i; j++)
			if(ok(vc[i],vc[j]))
			{
			/*************荳?握蝗セ蛹ケ驟肴ィ。譚ソ**********************/
				insert(g[vc[i].x][vc[i].y],g[vc[j].x][vc[j].y]);
			/*************荳?握蝗セ蛹ケ驟肴ィ。譚ソ**********************/
			}
		}
		/*************荳?握蝗セ蛹ケ驟肴ィ。譚ソ**********************/
		int ans = max_match();
		/*************荳?握蝗セ蛹ケ驟肴ィ。譚ソ**********************/
		if( ans * 2 == n) puts("YES");
			else puts("NO");
	}
		return 0;
}

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

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

int main()
{
	for(int i=1;i<=9;i++)
		for(int j=1;j<=9;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 <= 9;i++){
        for(int j = 1;j <= 9;j++){
             cout << i'x'j'=' << i * j << endl;
        }
    }
    return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>
#include <sstream>
#include <cassert>
using namespace std;
static const double EPS = 1e-5;
typedef long long ll;
typedef pair<int,int> PI;
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define MP make_pair
#define PB push_back


main(){
  rep(i,9)rep(j,9){
    cout<<i+1<<"x"<<j+1<<"="<<(i+1)*(j+1)<<endl;
  }
}

C++: #include <bits/stdc++.h>
#define times(i,a) for(int i=0;i<(int)a;i++)
using namespace std;

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

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

int main(){
    for{i=1;i<=9;i++}{
        for(j=1;j<=9;j++){
            cout << i << 'x' << j << '=' << i*j << 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<iostream>
#include<stdio.h>
#include<string>

using namespace std;

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