You have to organize meetings today. There are $N$ meetings for today. Meeting $i$ must start at time $start[i]$ and end at time $end[i]$. Unfortunately, there are only two meeting rooms available today. Consider meetings $a$ and $b$ intersecting in time if $max(start[a],\ start[b]) \ge min(end[a],\ end[b])$.

You cannot conduct two meetings in the same room at the same time.

Your task is to determine whether it is possible to hold all meetings using only two rooms. If yes, then print $1$. Otherwise, print $0$.

Function description

Complete the isPossible function in the editor. It contains the following parameters:

1. Parameter name: $n$
   • Type: INTEGER
   • Description: Number of meetings
2. Parameter name: $start$
   • Type: INTEGER ARRAY
   • Description: Start time of meetings
3. Parameter name: $end$
   • Type: INTEGER ARRAY
   • Description: End time of meetings
4. Return
   • The function must return an INTEGER denoting the answer to the problem. 
   • If it is possible to hold all the meetings using only two rooms, then it is $1$. Otherwise, it is $0$.

Input format 

• The first line contains an integer $n$ denoting the number of elements in $start$.
• Each line $i$ of $n$ subsequent lines (where $0 ≤ i < n$) contains an integer describing $start_i$.
• Each line $i$ of $n$ subsequent lines (where $0 ≤ i < n$) contains an integer describing $end_i$.

Constraints

$1 ≤ n ≤ 10^5\\ 1 ≤ start[i] ≤ 10^8\\ 1 ≤ end[i] ≤ 10^8$