#2010. [Ceoi2010]bodyguard

The input begins with the description of the rows. The first line of the input contains one positive integer R: the number of groups of rows. R lines follow. Each of these lines contains 2 positive integers: the required number of bodyguards in each row of the group and the number of rows that form the group. This is followed by the description of column groups. The next line contains one positive integer C: the number of groups of columns. C lines follow. Each of these lines contains 2 positive integers: the required number of bodyguards in each column of the group and the number of columns that form the group. You may assume that the total number of bodyguards required by row constrains is the same as the total number of bodyguards required by column constraints. You may assume that this total number of bodyguards is at most 10^18. You may assume that all numbers are positive integers that do not exceed 10^9 . You may assume 1<= R,C <= 200000 that . Several batches of test cases, worth a total of 50 points, satisfy the following criteria: the total number of rows in the auditorium will be at most 2000 the total number of columns in the auditorium will be at most 2000 the total number of bodyguards will be at most .

Output a single line with the number "1" if the constraints are satisfiable and the number "0" otherwise (quotes for clarity).