Anton likes to play chess. Also he likes to do programming. No wonder that he decided to attend chess classes and programming classes.

Anton has n variants when he will attend chess classes, i-th variant is given by a period of time (l1, i, r1, i). Also he has m variants when he will attend programming classes, i-th variant is given by a period of time (l2, i, r2, i).

Anton needs to choose exactly one of n possible periods of time when he will attend chess classes and exactly one of m possible periods of time when he will attend programming classes. He wants to have a rest between classes, so from all the possible pairs of the periods he wants to choose the one where the distance between the periods is maximal.

The distance between periods (l1, r1) and (l2, r2) is the minimal possible distance between a point in the first period and a point in the second period, that is the minimal possible |i - j|, where l1 ≤ i ≤ r1 and l2 ≤ j ≤ r2. In particular, when the periods intersect, the distance between them is 0.

Anton wants to know how much time his rest between the classes will last in the best case. Help Anton and find this number!

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 200 000) — the number of time periods when Anton can attend chess classes.

Each of the following n lines of the input contains two integers l1, i and r1, i (1 ≤ l1, i ≤ r1, i ≤ 109) — the i-th variant of a period of time when Anton can attend chess classes.

The following line of the input contains a single integer m (1 ≤ m ≤ 200 000) — the number of time periods when Anton can attend programming classes.

Each of the following m lines of the input contains two integers l2, i and r2, i (1 ≤ l2, i ≤ r2, i ≤ 109) — the i-th variant of a period of time when Anton can attend programming classes.

Output

Output one integer — the maximal possible distance between time periods.

Examples

Input

3
1 5
2 6
2 3
2
2 4
6 8

Output

3

Input

3
1 5
2 6
3 7
2
2 4
1 4

Output

0

Note

In the first sample Anton can attend chess classes in the period (2, 3) and attend programming classes in the period (6, 8). It's not hard to see that in this case the distance between the periods will be equal to 3.

In the second sample if he chooses any pair of periods, they will intersect. So the answer is 0.

 

题意：

给出n个上象棋课的时间段、m个上编程课的时间段，每个课程选择一个时间段去上课，询问两个课程之间最长的时间差（时间单位为天）

做法：

首先撇了一眼数据范围2e5，时限4s，开心地莽了发暴力，结果T掉了QWQ

优化：

只需要查找每种课的最早结束时间以及最晚开始时间，两者比较以下就OK，存都不需要存。

 

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+30;
const int inf=0x3f3f3f3f;

int main()
{
    ll n,m,l,r;
    while(~scanf("%lld",&n))
    {
        ll maxx1=-1,minn1=inf;
        for(int i=1; i<=n; i++)
        {
            scanf("%lld%lld",&l,&r);
            maxx1=max(maxx1,l);
            minn1=min(minn1,r);
        }
        scanf("%lld",&m);
        ll maxx2=-1,minn2=inf;
        for(int i=1; i<=m; i++)
        {
            scanf("%lld%lld",&l,&r);
            maxx2=max(maxx2,l);
            minn2=min(minn2,r);
        }
//        cout<<maxx2-minn1<<'\n';
//        cout<<maxx1-minn2<<'\n';
        ll ans;
        ans=max((maxx2-minn1),(maxx1-minn2));
        if(ans<0)
            ans=0;
        cout<<ans<<'\n';
    }
    return 0;
}