B"Monocarp is going to host a party for his friends. He prepared n dishes and is about to serve them. First, he has to add some powdered pepper to each of them -- otherwise, the dishes will be pretty tasteless. The i -th dish has two values a_i and b_i -- its tastiness with red pepper added or black pepper added, respectively. Monocarp won't add both peppers to any dish, won't add any pepper multiple times, and won't leave any dish without the pepper added. Before adding the pepper, Monocarp should first purchase the said pepper in some shop. There are m shops in his local area. The j -th of them has packages of red pepper sufficient for x_j servings and packages of black pepper sufficient for y_j servings. Monocarp goes to exactly one shop, purchases multiple (possibly, zero) packages of each pepper in such a way that each dish will get the pepper added once, and no pepper is left. More formally, if he purchases x red pepper packages and y black pepper packages, then x and y should be non-negative and x cdot x_j + y cdot y_j should be equal to n . For each shop, determine the maximum total tastiness of the dishes after Monocarp buys pepper packages only in this shop and adds the pepper to the dishes. If it's impossible to purchase the packages in the said way, print -1. The first line contains a single integer n ( 1 <= n <= 3 cdot 10^5 ) -- the number of dishes. The i -th of the next n lines contains two integers a_i and b_i ( 1 <= a_i, b_i <= 10^9 ) -- the tastiness of the i -th dish with red pepper added or black pepper added, respectively. The next line contains a single integer m ( 1 <= m <= 3 cdot 10^5 ) -- the number of shops. The j -th of the next m lines contains two integers x_j and y_j ( 1 <= x_j, y_j <= n ) -- the number of servings the red and the black pepper pack"...