For a vector \vec{v} = (x, y), define |v| = √{x^2 + y^2}.

Allen had a bit too much to drink at the bar, which is at the origin. There are n vectors \vec{v_1}, \vec{v_2}, ⋅⋅⋅, \vec{v_n}. Allen will make n moves. As Allen's sense of direction is impaired, during the i-th move he will either move in the direction \vec{v_i} or -\vec{v_i}. In other words, if his position is currently p = (x, y), he will either move to p + \vec{v_i} or p - \vec{v_i}.

Allen doesn't want to wander too far from home (which happens to also be the bar). You need to help him figure out a sequence of moves (a sequence of signs for the vectors) such that his final position p satisfies |p| ≤ 1.5 ⋅ 10^6 so that he can stay safe.

Input

The first line contains a single integer n (1 ≤ n ≤ 10^5) — the number of moves.

Each of the following lines contains two space-separated integers x_i and y_i, meaning that \vec{v_i} = (x_i, y_i). We have that |v_i| ≤ 10^6 for all i.

Output

Output a single line containing n integers c_1, c_2, ⋅⋅⋅, c_n, each of which is either 1 or -1. Your solution is correct if the value of p = ∑_{i = 1}^n c_i \vec{v_i}, satisfies |p| ≤ 1.5 ⋅ 10^6.

It can be shown that a solution always exists under the given constraints.

Examples

Input

3
999999 0
0 999999
999999 0


Output

1 1 -1 


Input

1
-824590 246031


Output

1 


Input

8
-67761 603277
640586 -396671
46147 -122580
569609 -2112
400 914208
131792 309779
-850150 -486293
5272 721899


Output

1 1 1 1 1 1 1 -1 
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.util.Comparator;
import java.util.Collections;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author kessido
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        CLeavingTheBar solver = new CLeavingTheBar();
        solver.solve(1, in, out);
        out.close();
    }

    static class CLeavingTheBar {
        private double[] p11 = new double[2];

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.NextInt();
            long[][] vector = in.NextLongMatrix(n, 2);
            ArrayList<Integer> order = new ArrayList<>();
            for (int i = 0; i < n; i++) {
                order.add(i);
            }
            long[] origin = new long[2];
            int run = 0;
            while (true) {
                long[] cur = new long[2];
                Collections.shuffle(order);
                if (run == 0) order.sort(Comparator.comparingDouble(o -> -dist(vector[o], origin)));
                int[] result = new int[n];
                for (int i : order) {
                    result[i] = choose(cur, vector[i]);
                }
                run++;
                if (dist(cur, origin) > 1.5 * 1e6) {
                    continue;
                }

                for (int i = 0; i < n; i++) {
                    out.print(result[i] + " ");
                }
                out.println();
                break;
            }
        }

        int choose(long[] cur, long[] v) {
            double m1, m2;
            m1 = dist(cur, v);
            v[0] *= -1;
            v[1] *= -1;
            m2 = dist(cur, v);
            if (m1 < m2) {
                cur[0] -= v[0];
                cur[1] -= v[1];
                return 1;
            } else {
                cur[0] += v[0];
                cur[1] += v[1];
                return -1;
            }
        }

        private double dist(long[] cur, long[] v) {
            p11[0] = cur[0] + v[0];
            p11[1] = cur[1] + v[1];
            p11[0] *= p11[0];
            p11[1] *= p11[1];
            return Math.sqrt(p11[0] + p11[1]);
        }

    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine(), " \t\n\r\f,");
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int NextInt() {
            return Integer.parseInt(next());
        }

        public long NextLong() {
            return Long.parseLong(next());
        }

        public long[][] NextLongMatrix(int n, int m) {
            return NextLongMatrix(n, m, 0);
        }

        public long[][] NextLongMatrix(int n, int m, int offset) {
            long[][] a = new long[n][m];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    a[i][j] = NextLong() + offset;
                }
            }
            return a;
        }

    }
}

