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

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

int m[200][200];
PII d[] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1} };
string ans[] = {"right\n", "left\n", "up\n", "down\n"};
vector<VI> v = {{3, 1, 1, 2}, {}, {3, 1}, {2, 1}};
int x, y;
int res, c;

void move(int idx)
{	
	res++;
	assert(res <= 1e5);
	cout << ans[idx];
	if (m[x + d[idx].first][y + d[idx].second] != 1)
	{
		x += d[idx].first;
		y += d[idx].second;
		return;
	}
	int cnt = 1;
	while (m[x + (cnt + 1) * d[idx].first][y + (cnt + 1) * d[idx].second] == 1)
	{
		cnt++;
	}
	if (m[x + (cnt + 1) * d[idx].first][y + (cnt + 1) * d[idx].second] != 2)
	{
		m[x + (cnt + 1) * d[idx].first][y + (cnt + 1) * d[idx].second] = 1;
	}
	else
		c--;
	if (c == 0)
		exit(0);
		
	x += d[idx].first;
	y += d[idx].second;
	m[x][y] = 0;
}

void move2(int idx, int cnt)
{
	for (auto mv : v[idx]) move(mv);
	FOR (i, 0, cnt) move(idx);
	if (c)
		RFOR (i, SZ(v[idx]), 0) move(v[idx][i] ^ 1);
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;
	c = n;
	int x2, y2;
	cin >> x >> y >> x2 >> y2;
	x += 74, y += 74, x2 += 74, y2 += 74;
	m[x2][y2] = 2;
	FOR (i, 0, n)
	{
		int a, b;
		cin >> a >> b;
		a += 74, b += 74;
		m[a][b] = 1;
	}
	FOR (i, 0, n)
	{
		int px = -1, py = -1;
		FOR (X, 0, 200) 
		{
			FOR (Y, 0, 200)
			{
				if (m[X][Y] == 1) px = X, py = Y;
			}
		}
		if (px == -1) break;
		if (y == py) move(2);
		while (x > px + 1) move(1);
		while (x < px + 1) move(0);
		while (y < py) move(2);
		while (y > py) move(3);
		if (px < x2) move2(0, x2 - px);
		if (px > x2) move2(1, px - x2);
		if (py < y2) move2(2, y2 - py);
		if (py > y2) move2(3, py - y2);
	}
	return 0;
}