C - Third-Party Software Gym - 101755C （贪心）

Pavel is developing a game. To do that, he needs functions available in a third-party library too famous to be called. It is known that the function i first appeared in version ai and existed until version bi, and starting from the version bi + 1, it is absent in this library.

The library is not free and Pavel needs all the functions. Which minimal number of versions he need to purchase to be able to use all the functions?

Input

The first line contains a single integer n (1 ≤ n ≤ 200000) — the number of the functions.

Each of the next n lines contains two integers ai and bi (1 ≤ ai ≤ bi ≤ 109) — the interval of library versions where function i was available.

Output

In the first line output a single integer k — the minimal number of library versions need to be purchased to unlock all functions.

In the second line output k distinct integers — the numbers of versions need to be purchased.

If there are several possible answers, output any of them.

Example

Input

5
2 4
1 3
2 3
3 6
4 5

Output

2
3 4

//Full of love and hope for life

#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <queue>
#define inf 0x3f3f3f3f
//https://paste.ubuntu.com/

using namespace std;

struct node
{
    long long int x,y;
};

node n[200010];

int cmp(node a,node b){
   if(a.x==b.x){
    return a.y<b.y;
   }
   return a.x<b.x;
}

int main()
{
   long long int a,k=0;
   long long int m[200010];
   cin >> a;
   for(int i=1;i<=a;i++){
    cin >> n[i].x >> n[i].y;
   }
   if(a==1){
        cout << a << endl;
    cout << n[1].x;
   }
   else{
   sort(n+1,n+a+1,cmp);
   for(int i=1;i<a;i++){
    n[i].x=max(n[i+1].x,n[i].x);
    n[i].y=min(n[i+1].y,n[i].y);
    if(n[i].x>n[i].y){
        m[++k]=n[i].y;
      if(i==a-1){
        m[++k]=n[i+1].x;
     }
    }
    else{
        n[i+1].x=n[i].x;
        n[i+1].y=n[i].y;
         if(i==a-1){
        m[++k]=n[i+1].x;
     }
    }
   }
   cout << k << endl;
   for(int i=1;i<=k;i++){
    if(i==k){
        cout << m[i];
    }
    else{
        cout << m[i] << " ";
    }
   }}
    return 0;
}