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

struct tree {
    int aray[10][10];
    struct tree *parent;
    struct tree *child[24];
    int locked;
    int level;
};
typedef struct tree node;

int counters = 0;
map<vector<int>, int> check_map;
pair<pair<int, int>, pair<int, int> > find_space(node *node1, int n) {
	pair<int, int> pairs[2];
	int k = 0;
    for (int i = 0; i  < n; i++) {
        for (int j = 0; j < n; j++) {
            if (node1->aray[i][j] == -1) {
                pairs[k++] =  make_pair(i, j);
                if (k == 2)
                return make_pair(pairs[0], pairs[1]);
            }
        }
    }
    return make_pair(make_pair(0, 0), make_pair(0, 0));
}

double find_tan(double x) {
    return tan(x);
}

bool solved(node *temp, int n) {
    for (int i = 0; i  < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i == n - 1 && j == n - 1) {
                if (temp->aray[i][j] != -1)
                    return 0;
            }
            else if (i == n - 1 && j == n - 2) {
                if (temp->aray[i][j] != -1)
                return 0;
                }
            else if (temp->aray[i][j] != (n * i) + j + 1) {
                return 0;
            }
        }
    }
    return 1;
}

void funct(double jjhjhj[], double y_cord[]) {
	double var2, var1, var3, var4;
	var1 = 0;
	var3 = -100;
	var4 = 10 ;

	var2 = 0;

	double a = (var4-var2) / (var4 - 0);
	double b = (var2 - 0) / (var4 - 0);
	double ang = a * find_tan(0.1);
	ang = 90 - ang;
	ang = ang * (22 / 7) / 180;
	double xjjhjhj[24], yy_cord[24];
	for (int i = 0; i < 24; i++) {


		xjjhjhj[i] = jjhjhj[i] * cos(ang) - y_cord[i] * sin(ang);

		yy_cord[i] = jjhjhj[i] * sin (ang) + y_cord[i] * cos(ang);
		cout << (int)xjjhjhj[i] << " " << (int)yy_cord[i] << endl;
	}

}

void show() {

double jjhjhj[24], y_cord[24];
        jjhjhj[0] = -100;
        y_cord[0] = 700;
        jjhjhj[1] = -100;
        y_cord[1] = 500;
        jjhjhj[2] = 100;
        y_cord[2] = 500;
        jjhjhj[3] = 100;
        y_cord[3] = 700;
        jjhjhj[4] = -50;
        y_cord[4] = 0;
        jjhjhj[5] = -50;
        y_cord[5] = 500;
        jjhjhj[6] = -150;
        y_cord[6] = 0;
        jjhjhj[7] = -500;
        y_cord[7] = 400;
        jjhjhj[8] = -500;
        y_cord[8] = 400;
        jjhjhj[9] = -100;
        y_cord[9] = 700;
        jjhjhj[10] = -50;
        y_cord[10] = 0;
        jjhjhj[11] = -400;
        y_cord[11] = 400;
        jjhjhj[12] = -400;
        y_cord[12] = 400;
        jjhjhj[13] = -100;
        y_cord[13] = 600;
        jjhjhj[14] = 50;
        y_cord[14] = 0;
        jjhjhj[15] = 50;
        y_cord[15] = 500;
        jjhjhj[16] = 150;
        y_cord[16] = 0;
        jjhjhj[17] = 500;
        y_cord[17] = 400;
        jjhjhj[18] = 500;
        y_cord[18] = 400;
        jjhjhj[19] = 100;
        y_cord[19] = 700;
        jjhjhj[20] = 50;
        y_cord[20] = 0;
        jjhjhj[21] = 400;
        y_cord[21] = 400;
        jjhjhj[22] = 400;
        y_cord[22] = 400;
        jjhjhj[23] = 100;
        y_cord[23] = 600;

	funct(jjhjhj, y_cord);
	//glFlush();

}

int main()
{

	show();

	return 0;

}