Given the counts (A and B) of number of entries by two guards, what is the minimum and maximum number of entries that could have happened, given that atleast one of them is always awake.
Minimum occurs when they count as much as possible entries together. So the minimum would be the maximum(A,B).
Maximum occurs when each entry was counted only by one guard. So the maximum would be sum of counts of both i.e. A+B.
A ∪ B is the total number of entries.
To maximise A ∪ B, make A ∩ B = 0, then A ∪ B = sizeof(A)+sizeof(B).
To minimise A ∪ B, make any one set as a subset of other. Then the A ∪ B = maximum(sizeof(A),sizeof(B)).
a,b=input() print max(a,b),a+b