Problem: This is an interactive problem.

In good old times dwarves tried to develop extrasensory abilities:

  * Exactly n dwarves entered completely dark cave. 
  * Each dwarf received a hat — white or black. While in cave, none of the dwarves was able to see either his own hat or hats of other Dwarves. 
  * Dwarves went out of the cave to the meadow and sat at an arbitrary place one after the other. When a dwarf leaves the cave, he sees the colors of all hats of all dwarves that are seating on the meadow (i.e. left the cave before him). However, he is not able to see the color of his own hat and none of the dwarves can give him this information. 
  * The task for dwarves was to got diverged into two parts — one with dwarves with white hats and one with black hats. 



After many centuries, dwarves finally managed to select the right place on the meadow without error. Will you be able to repeat their success?

You are asked to successively name n different integer points on the plane. After naming each new point you will be given its color — black or white. Your task is to ensure that the named points can be split by a line in such a way that all points of one color lie on the same side from the line and points of different colors lie on different sides. Moreover, no points can belong to the line. Also, you need to report any such line at the end of the process.

In this problem, the interactor is adaptive — the colors of the points in the tests are not fixed beforehand and the jury program can select them arbitrarily, in particular, depending on your program output.

Interaction

The first line of the standard input stream contains an integer n (1 ≤ n ≤ 30) — the number of points your program should name.

Then n times your program must print two integer coordinates x and y (0 ≤ x ≤ 109, 0 ≤ y ≤ 109). All points you print must be distinct.

In response to each coordinate pair your program will receive the string "black", if the point is black, or "white", if the point is white.

When all n points are processed, you need to print four integers x1, y1, x2 and y2 (0 ≤ x1, y1 ≤ 109, 0 ≤ x2, y2 ≤ 109) — coordinates of points (x1, y1) and (x2, y2), which form a line, which separates n points into black and white. Points (x1, y1) and (x2, y2) should not coincide.

Hacks

To hack solution use the following format. The first line must contain word "hack", the second line should contain the number n and the last line should contain the sequence of 0 and 1 — colors of points, which will be reported to the solution. Unlike the jury tests, colors of points in hacks are always fixed in advance. Of course, the hacked solution wouldn't be able to get the information about the colors in advance.

For example, the hack corresponding to sample test will look like this: 
    
    
      
    hack  
    5  
    0 0 1 1 0  
    

Example

Input

5
<span class="tex-span"></span>
black
<span class="tex-span"></span>
black
<span class="tex-span"></span>
white
<span class="tex-span"></span>
white
<span class="tex-span"></span>
black


Output

<span class="tex-span"></span>
0 0
<span class="tex-span"></span>
3 1
<span class="tex-span"></span>
2 3
<span class="tex-span"></span>
4 4
<span class="tex-span"></span>
0 2
<span class="tex-span"></span>
1 3 4 1

Note

In the sample input and output values are aligned only for simplicity of interpreting them chronologically. In real interaction no "extra" line breaks should appear.

The following picture illustrates the first test.

<image>

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Queue;
import java.util.Random;
import java.util.Set;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;

/**
 * Created by timur on 28.03.15.
 */

public class TaskE {
    boolean eof;
    BufferedReader br;
    StringTokenizer st;
    PrintWriter out;

    public static void main(String[] args) throws IOException {
        new TaskE().run();
    }

    public String nextToken() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (Exception e) {
                eof = true;
                return "-1";
            }
        }
        return st.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(nextToken());
    }

    public long nextLong() {
        return Long.parseLong(nextToken());
    }

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

    String nextLine() throws IOException {
        return br.readLine();
    }


    void run() throws IOException {
        InputStream input = System.in;
        PrintStream output = System.out;
        try {
            File f = new File("ad.in");
            if (f.exists() && f.canRead()) {
                input = new FileInputStream(f);
                output = new PrintStream("a.out");
            }
        } catch (Throwable e) {
        }
        br = new BufferedReader(new InputStreamReader(input));
        out = new PrintWriter(output);
        solve();
        br.close();
        out.close();
    }

    final Random RNG = new Random();

    class Node<K> {
        K key;
        int priority;
        int size;
        Node<K> l;
        Node<K> r;

        public Node(K k) {
            priority = RNG.nextInt();
            this.key = k;
            size = 1;
        }
    }

    class MySetGen<K extends Comparable<K>> {


        Node<K> root;

        void add(K e) {
            if (contains(e)) {
                return;
            }
            Node<K>[] t = split(root, e);
            root = merge(t[0], new Node<K>(e));
            root = merge(root, t[1]);
        }

        private Node<K> merge(Node<K> l, Node<K> r) {
            if (l == null) {
                return r;
            }
            if (r == null) {
                return l;
            }
            Node<K> ret;
            if (l.priority > r.priority) {
                l.r = merge(l.r, r);
                ret = l;
            } else {
                r.l = merge(l, r.l);
                ret = r;
            }
            ret.size = 1;
            if (ret.l != null) {
                ret.size += ret.l.size;
            }
            if (ret.r != null) {
                ret.size += ret.r.size;
            }
            return ret;
        }

        private Node<K>[] split(Node<K> v, K e) {
            if (v == null) {
                return new Node[2];
            }
            Node<K>[] t;
            if (v.key.compareTo(e) < 0) {
                t = split(v.r, e);
                v.r = t[0];
                v.size = 1;
                if (v.l != null) {
                    v.size += v.l.size;
                }
                if (v.r != null) {
                    v.size += v.r.size;
                }
                t[0] = v;
            } else {
                t = split(v.l, e);
                v.l = t[1];
                v.size = 1;
                if (v.l != null) {
                    v.size += v.l.size;
                }
                if (v.r != null) {
                    v.size += v.r.size;
                }
                t[1] = v;
            }
            return t;
        }

        private Node<K> get(Node<K> v, K e) {
            if (v == null) {
                return null;
            }
            int comp = v.key.compareTo(e);
            if (comp == 0) {
                return v;
            } else if (comp < 0) {
                return get(v.r, e);
            } else {
                return get(v.l, e);
            }
        }

        boolean contains(K e) {
            return get(root, e) != null;
        }

    }

    int mod = 998244353;

    int exp(int base, int e) {
        if (e == 0)
            return 1;
        if (e == 1)
            return base;
        int val = exp(base, e / 2);
        int ans = (int) ((long) val * val % mod);
        if (e % 2 == 1)
            ans = (int) ((long) ans * base % mod);
        return ans;
    }

    void solve() {
        int n = nextInt();

        long l = 0;
        long r = 1000000000;

        out.println("1 0");
        out.flush();
        String color1 = nextToken();

        for (int i = 1; i < n; i++) {
            long m = l + (r - l) / 2;
            out.println("1 " + m);
            out.flush();
            String color = nextToken();
            if (color.equals(color1)) {
                l = m;
            } else {
                r = m;
            }
        }
        out.println("2 " + l + " 0 " + r);
        out.flush();
    }
}