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 (l_1, i, r_1, i). Also he has m variants when he will attend programming classes, i-th variant is given by a period of time (l_2, i, r_2, 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 (l₁, r₁) and (l₂, r₂) 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 l₁ ≤ i ≤ r₁ and l₂ ≤ j ≤ r₂. 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!

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 l_1, i and r_1, i (1 ≤ l_1, i ≤ r_1, i ≤ 10⁹) — 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 l_2, i and r_2, i (1 ≤ l_2, i ≤ r_2, i ≤ 10⁹) — the i-th variant of a period of time when Anton can attend programming classes.

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