B'Little Rosie has a phone with a desktop (or launcher, as it is also called). The desktop can consist of several screens. Each screen is represented as a grid of size 5 x 3 , i.e., five rows and three columns. There are x applications with an icon size of 1 x 1 cells; such an icon occupies only one cell of the screen. There are also y applications with an icon size of 2 x 2 cells; such an icon occupies a square of 4 cells on the screen. Each cell of each screen can be occupied by no more than one icon. Rosie wants to place the application icons on the minimum number of screens. Help her find the minimum number of screens needed. The first line of the input contains t ( 1 <= q t <= q 10^4 ) -- the number of test cases. The first and only line of each test case contains two integers x and y ( 0 <= q x, y <= q 99 ) -- the number of applications with a 1 x 1 icon and the number of applications with a 2 x 2 icon, respectively. For each test case, output the minimal number of required screens on a separate line. The solution for the first test case can look as follows: The solution for the third test case can look as follows: '...