Problem: Polycarpus loves convex polygons, especially if all their angles are the same and all their sides are different. Draw for him any such polygon with the given number of vertexes.

Input

The input contains a single integer n (3 ≤ n ≤ 100) — the number of the polygon vertexes.

Output

Print n lines, containing the coordinates of the vertexes of the n-gon "xi yi" in the counter clockwise order. The coordinates of the vertexes shouldn't exceed 106 in their absolute value. The side lengths should fit within limits [1, 1000] (not necessarily integer). Mutual comparing sides and angles of your polygon during the test will go with precision of 10 - 3.

If there is no solution, print "No solution" (without the quotes).

Examples

Input

8


Output

1.000 0.000
7.000 0.000
9.000 2.000
9.000 3.000
5.000 7.000
3.000 7.000
0.000 4.000
0.000 1.000

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;

public class TaskA {
	FastScanner in;
	PrintWriter out;

	public void solve() throws IOException {
		int n = in.nextInt();
		if (n <= 4) {
			out.println("No solution");
			return;
		}
		double alpha = 2 * Math.PI / n;
		double curAlpha = 0;
		double[] x = new double[n], y = new double[n];
		double r = 1000;
		if (n <= 10) {
			r = 500;
		}
		for (int i = 0; i < n; i++) {
			x[i] = r * Math.cos(curAlpha);
			y[i] = r * Math.sin(curAlpha);
			curAlpha += alpha;
		}
		double s = 1;
		for (int i = 0; i < n; i++) {
			double x1 = x[(i + n - 1) % n] - x[i];
			double x2 = x[(i + 2) % n] - x[(i + 1) % n];
			double y1 = y[(i + n - 1) % n] - y[i];
			double y2 = y[(i + 2) % n] - y[(i + 1) % n];
			double len1 = Math.sqrt(x1 * x1 + y1 * y1);
			double len2 = Math.sqrt(x2 * x2 + y2 * y2);
			x1 = x1 * s / len1; y1 = y1 * s / len1;
			x2 = x2 * s / len2; y2 = y2 * s / len2;
			x[i] += x1;
			y[i] += y1;
			x[(i + 1) % n] += x2;
			y[(i + 1) % n] += y2;
			s += 0.31;
		}
		for (int i = 0; i < n; i++) {
			out.println(x[i] + " " + y[i]);
		}
	}

	public void run() {
		try {
			in = new FastScanner();
			out = new PrintWriter(System.out);

			solve();

			out.close();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}

	class FastScanner {
		BufferedReader br;
		StringTokenizer st;

		FastScanner() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		boolean hasNext() {
			while (st == null || !st.hasMoreTokens()) {
				try {
					String s = br.readLine();
					if (s == null) {
						return false;
					}
					st = new StringTokenizer(s);
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return true;
		}

		String next() {
			while (st == null || !st.hasMoreTokens()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}
	}

	public static void main(String[] arg) {
		new TaskA().run();
	}
}