#include <set>
#include <map>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <fstream>
#include <ctime>
#include <deque>
#include <bitset>
#include <cctype>
#include <utility>
#include <cassert>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
typedef unsigned long long ull;

#define Rep(i,n) for(int i = 0; i < (n); ++i)
#define Repd(i,n) for(int i = (n)-1; i >= 0; --i)
#define For(i,a,b) for(int i = (a); i <= (b); ++i)
#define Ford(i,a,b) for(int i = (a); i >= (b); --i)
#define Fit(i,v) For(__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
#define Fitd(i,v) For(__typeof((v).rbegin()) i = (v).rbegin(); i != (v).rend(); ++i)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(), (a).end()
#define ms(a,x) memset(a, x, sizeof(a))

template<class F, class T> T convert(F a, int p = -1) { stringstream ss; if (p >= 0) ss << fixed << setprecision(p); ss << a; T r; ss >> r; return r; }
template<class T> T gcd(T a, T b) { T r; while (b != 0) { r = a % b; a = b; b = r; } return a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T> T sqr(T x) { return x * x; }
template<class T> T cube(T x) { return x * x * x; }
template<class T> int getbit(T s, int i) { return (s >> i) & 1; }
template<class T> T onbit(T s, int i) { return s | (T(1) << i); }
template<class T> T offbit(T s, int i) { return s & (~(T(1) << i)); }
template<class T> int cntbit(T s) { return __builtin_popcount(s); }
const int bfsz = 1 << 16; char bf[bfsz + 5]; int rsz = 0;int ptr = 0;
char gc() { if (rsz <= 0) { ptr = 0; rsz = (int) fread(bf, 1, bfsz, stdin); if (rsz <= 0) return EOF; } --rsz; return bf[ptr++]; }
void ga(char &c) { c = EOF; while (!isalpha(c)) c = gc(); }
int gs(char s[]) { int l = 0; char c = gc(); while (isspace(c)) c = gc(); while (c != EOF && !isspace(c)) { s[l++] = c; c = gc(); } s[l] = '\0'; return l; }
template<class T> bool gi(T &v) {
    v = 0; char c = gc(); while (c != EOF && c != '-' && !isdigit(c)) c = gc(); if (c == EOF) return false; bool neg = c == '-'; if (neg) c = gc();
    while (isdigit(c)) { v = v * 10 + c - '0'; c = gc(); } if (neg) v = -v; return true;
}

typedef pair<int, int> II;

const ld PI = acos(ld(-1.0));
const ld eps = 1e-9;

const int inf = (int)1e9 + 5;
const ll linf = (ll)1e17 + 5;
int dr[4] = {-1, 0, +1, 0};
int dc[4] = {0, -1, 0, +1};
const ll mod = 1000000007;

#define maxn 100005

#define maxv 100005
#define pos(v) ((v) << 1)
#define neg(v) (pos(v) ^ 1)

map<II, II> M;
map<II, int> Mi;

int X[maxn], Y[maxn];
int n;

struct triple{
	int x, y, z;
	triple(){};
	triple(int _x, int _y, int _z){
		x = _x; y = _y; z = _z;
	}
};

triple que[maxn];
int size;

bool go(int x, int y, int color){

	size = 0;
	que[size++] = triple(x, y, color);
	bool res = true;

	Rep(i, size){
		x = que[i].x; y = que[i].y, color = que[i].z;
		II P = M[mp(x, y)];
		int xx = P.fi, yy = P.se, xt, yt;
		if(Mi[P] && Mi[P] + color != 3){
			res = false;
		}

		Rep(h, 4){
			xt = x + dr[h];
			yt = y + dc[h];
			if(xt == xx && yt == yy) continue;
	//		cout << xt << " " << yt << endl;
			if(M.count(mp(xt, yt))){
				if(Mi[mp(xt, yt)]){
					if(Mi[mp(xt, yt)] != color) res = false;
				}
				else{
					Mi[mp(xt, yt)] = color;
					que[size++] = triple(xt, yt, color);
				}
			}
		}
		if(Mi[P] && Mi[P] + color != 3){
			res = false;
		}
		if(!Mi[P]){
			Mi[P] = 3 - color;
			que[size++] = triple(xx, yy, 3 - color);
		}
	}
	return res;
}

void solve(){
	int x, y, xx, yy;
	char h;
	M.clear(); Mi.clear();
	For(i, 1, n){
		cin >> x >> y >> h;
		X[i] = x;
		Y[i] = y;
		if(h == 'x'){
			xx = x + 1;
			yy = y;
		}
		else{
			xx = x;
			yy = y + 1;
		}
		M[mp(x, y)] = mp(xx, yy);
		M[mp(xx, yy)] = mp(x, y);
	}

	bool res = true;
	For(i, 1, n){
		if(!Mi[mp(X[i], Y[i])]){
			Mi[mp(X[i], Y[i])] = 1;
			if(!go(X[i], Y[i], 1)){
				res = false;
				break;
			}
		}
	}
	if(res) cout << "Yes" << endl;
	else cout << "No" << endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
//    freopen("in.txt", "r", stdin);

    while(cin >> n && n > 0){
    	solve();
    }

    return 0;
}