Problem: On a history lesson the teacher asked Vasya to name the dates when n famous events took place. He doesn't remembers the exact dates but he remembers a segment of days [li, ri] (inclusive) on which the event could have taken place. However Vasya also remembers that there was at most one event in one day. Help him choose such n dates of famous events that will fulfill both conditions. It is guaranteed that it is possible.

Input

The first line contains one integer n (1 ≤ n ≤ 100) — the number of known events. Then follow n lines containing two integers li and ri each (1 ≤ li ≤ ri ≤ 107) — the earliest acceptable date and the latest acceptable date of the i-th event.

Output

Print n numbers — the dates on which the events took place. If there are several solutions, print any of them. It is guaranteed that a solution exists.

Examples

Input

3
1 2
2 3
3 4


Output

1 2 3 


Input

2
1 3
1 3


Output

1 2 

Solution (in JAVA):

Solution:

import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
import java.util.Calendar;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.SortedSet;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

/**
 * #
 * @author pttrung
 */
public class D_SchoolTeamContest_3 {

    public static long MOD = 1000000007;
    static int min;

    public static void main(String[] args) throws FileNotFoundException {
        // PrintWriter out = new PrintWriter(new FileOutputStream(new File(
        // "output.txt")));
        PrintWriter out = new PrintWriter(System.out);
        Scanner in = new Scanner();
        int n = in.nextInt();
        Point[] data = new Point[n];
        TreeSet<Point> end = new TreeSet();
        int cur = 0;
        for (int i = 0; i < n; i++) {
            data[i] = new Point(in.nextInt(), in.nextInt(), i);
            end.add(new Point(data[i].x, data[i].x, 0));
            end.add(new Point(data[i].y, data[i].y, 1));
        }
        //System.out.println(end);

        int index = 0;
        ArrayList<Point> map = new ArrayList();
        int last = -1;
        for (Point p : end) {
            if (last != -1) {
                map.add(new Point(last, p.x - (p.index == 0 ? 1 : 0), index++));

            }
            last = p.x + p.index;
        }
        //System.out.println(map);
        int total = 2 + n + index;
        int first = 1 + n;
        int[][] flow = new int[total][total];
        for (int i = 0; i < n; i++) {
            flow[0][i + 1] = 1;
            for (Point p : map) {
                if (data[i].x <= p.x && p.y <= data[i].y) {
                    flow[i + 1][first + p.index] = 1;
                }
            }
        }
        for (int i = first; i < total - 1; i++) {
            flow[i][total - 1] = map.get(i - first).y - map.get(i - first).x
                    + 1;
        }

        int[] pa = new int[total];
        int[] count = new int[index];
        int res = 0;
        while (true) {
            Arrays.fill(pa, -1);
            min = Integer.MAX_VALUE;
            pa[0] = 0;
            LinkedList<Integer> q = new LinkedList();
            q.add(0);
            while (!q.isEmpty()) {
                int v = q.poll();
                for (int i = 0; i < total; i++) {
                    if (flow[v][i] > 0 && pa[i] == -1) {
                        pa[i] = v;
                        q.add(i);
                    }
                }
            }
            if (pa[total - 1] == -1) {
                break;
            }
            update(total - 1, pa, flow);
            if (min == 0) {
                break;
            }
            res += min;
        }
        //out.println(res + " " + index);
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < index; j++) {
                if (flow[j + first][i + 1] == 1) {
                    out.print((count[j]++ + map.get(j).x) + " ");
                    break;
                }
            }
        }
        out.close();
    }

    static void update(int index, int[] pa, int[][] flow) {
        if (index != pa[index]) {
            min = Math.min(min, flow[pa[index]][index]);
            update(pa[index], pa, flow);
            flow[pa[index]][index] -= min;
            flow[index][pa[index]] += min;
        }
    }

    public static int[] KMP(String val) {
        int i = 0;
        int j = -1;
        int[] result = new int[val.length() + 1];
        result[0] = -1;
        while (i < val.length()) {
            while (j >= 0 && val.charAt(j) != val.charAt(i)) {
                j = result[j];
            }
            j++;
            i++;
            result[i] = j;
        }
        return result;

    }

    public static boolean nextPer(int[] data) {
        int i = data.length - 1;
        while (i > 0 && data[i] < data[i - 1]) {
            i--;
        }
        if (i == 0) {
            return false;
        }
        int j = data.length - 1;
        while (data[j] < data[i - 1]) {
            j--;
        }
        int temp = data[i - 1];
        data[i - 1] = data[j];
        data[j] = temp;
        Arrays.sort(data, i, data.length);
        return true;
    }

    public static int digit(long n) {
        int result = 0;
        while (n > 0) {
            n /= 10;
            result++;
        }
        return result;
    }

    public static double dist(long a, long b, long x, long y) {
        double val = (b - a) * (b - a) + (x - y) * (x - y);
        val = Math.sqrt(val);
        double other = x * x + a * a;
        other = Math.sqrt(other);
        return val + other;

    }

    public static class Point implements Comparable<Point> {

        int x, y, index;

        public Point(int start, int end, int index) {
            this.x = start;
            this.y = end;
            this.index = index;
        }

        @Override
        public int hashCode() {
            int hash = 5;
            hash = 47 * hash + this.x;
            hash = 47 * hash + this.y;
            return hash;
        }

        @Override
        public String toString() {
            return "Point [x=" + x + ", y=" + y + ", index=" + index + "]";
        }

        @Override
        public boolean equals(Object obj) {
            if (obj == null) {
                return false;
            }
            if (getClass() != obj.getClass()) {
                return false;
            }
            final Point other = (Point) obj;
            if (this.x != other.x) {
                return false;
            }
            if (this.y != other.y) {
                return false;
            }
            return true;
        }

        @Override
        public int compareTo(Point o) {
            if (x != o.x) {
                return Integer.compare(x, o.x);
            }
            return Integer.compare(index, o.index);
        }
    }

    public static class FT {

        long[] data;

        FT(int n) {
            data = new long[n];
        }

        public void update(int index, long value) {
            while (index < data.length) {
                data[index] += value;
                index += (index & (-index));
            }
        }

        public long get(int index) {
            long result = 0;
            while (index > 0) {
                result += data[index];
                index -= (index & (-index));
            }
            return result;

        }
    }

    public static long gcd(long a, long b) {
        if (b == 0) {
            return a;
        }
        return gcd(b, a % b);
    }

    public static long pow(long a, long b, long MOD) {
        if (b == 0) {
            return 1;
        }
        if (b == 1) {
            return a;
        }
        long val = pow(a, b / 2, MOD);
        if (b % 2 == 0) {
            return val * val % MOD;
        } else {
            return val * (val * a % MOD) % MOD;

        }
    }

    static class Scanner {

        BufferedReader br;
        StringTokenizer st;

        public Scanner() throws FileNotFoundException {
            // System.setOut(new PrintStream(new BufferedOutputStream(System.out), true));
            br = new BufferedReader(new InputStreamReader(System.in));
            //  br = new BufferedReader(new InputStreamReader(new FileInputStream(new File("input.txt"))));
        }

        public String next() {

            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                    throw new RuntimeException();
                }
            }
            return st.nextToken();
        }

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

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

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

        public String nextLine() {
            st = null;
            try {
                return br.readLine();
            } catch (Exception e) {
                throw new RuntimeException();
            }
        }

        public boolean endLine() {
            try {
                String next = br.readLine();
                while (next != null && next.trim().isEmpty()) {
                    next = br.readLine();
                }
                if (next == null) {
                    return true;
                }
                st = new StringTokenizer(next);
                return st.hasMoreTokens();
            } catch (Exception e) {
                throw new RuntimeException();
            }
        }
    }
}