You are looking at a dinner table at night and cannot clearly see how many people are sitting there. However, you can make out some of their body parts in the dark. In total, you count N left-hand fingers, M right-hand fingers, L left legs, and R right legs.
Assume that every person has exactly 5 left-hand fingers, 5 right-hand fingers, 1 left leg, and 1 right leg. Because it is dark, a person might only have a fraction of their body parts visible. For example, you might see just 2 left-hand fingers of one person, 1 right leg of another person, and all fingers and legs of a third person.
Find the minimum and maximum number of people that could possibly account for these visible body parts. You should assume there are no completely hidden people at the table (i.e., every person sitting at the table contributes at least one visible body part to your count).
Input
Four integers N, M, L, R (0 \le N, M, L, R \le 10^{9}), representing the total visible count of left-hand fingers, right-hand fingers, left legs, and right legs respectively.
Output
Print two integers: the minimum and maximum possible number of people sitting at the table.
Examples
| standard input | standard output |
|---|
| 10 10 1 1
| 2 22
|
| 1 0 0 0
| 1 1
|
Note
In the first example:
The minimum number of people is 2. Since a person has at most 5 left-hand fingers, you need at least 2 people to account for 10 left-hand fingers. Two people could easily possess 10 left-hand fingers, 10 right-hand fingers, 1 left leg, and 1 right leg among the parts they have visible.
The maximum number of people is 22. This happens if every single visible body part belongs to a completely different person (10 people showing 1 left-hand finger each + 10 people showing 1 right-hand finger each + 1 person showing a left leg + 1 person showing a right leg).
In the second example, there is only 1 left-hand finger visible, which means exactly 1 person is at the table with only one of their fingers visible.