Old MacDonald has a farm and a large potato field, (10 10 + 1) × (10 10 + 1) square meters in size. The field is divided into square garden beds, each bed takes up one square meter. Old McDonald knows that the Colorado potato beetle is about to invade his farm and can destroy the entire harvest. To fight the insects, Old McDonald wants to spray some beds with insecticides. So Old McDonald went to the field, stood at the center of the central field bed and sprayed this bed with insecticides. Now he's going to make a series of movements and spray a few more beds. During each movement Old McDonald moves left, right, up or down the field some integer number of meters. As Old McDonald moves, he sprays all the beds he steps on. In other words, the beds that have any intersection at all with Old McDonald's trajectory, are sprayed with insecticides. When Old McDonald finished spraying, he wrote out all his movements on a piece of paper. Now he wants to know how many beds won't be infected after the invasion of the Colorado beetles. It is known that the invasion of the Colorado beetles goes as follows. First some bed on the field border gets infected. Than any bed that hasn't been infected, hasn't been sprayed with insecticides and has a common side with an infected bed, gets infected as well. Help Old McDonald and determine the number of beds that won't be infected by the Colorado potato beetle. The first line contains an integer n ( 1 ≤ n ≤ 1000 ) — the number of Old McDonald's movements. Next n lines contain the description of Old McDonald's movements. The i -th of these lines describes the i -th movement. Each movement is given in the format " d i x i ", where d i is the character that determines the direction of the movement (" L ", " R ", " U " or " D " for directions "left", "right", "up" and "down", correspondingly), and x i ( 1 ≤ x i ≤ 10 6 ) is an integer that determines the number of meters in the movement. Print a single integer — the number of beds tha