B'One day n friends gathered together to play "Mafia". During each round of the game some player must be the supervisor and other n xe2 x80 x89- xe2 x80 x891 people take part in the game. For each person we know in how many rounds he wants to be a player, not the supervisor: the i-th person wants to play ai rounds. What is the minimum number of rounds of the "Mafia" game they need to play to let each person play at least as many rounds as they want? The first line contains integer n (3 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105). The second line contains n space-separated integers a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109) -- the i-th number in the list is the number of rounds the i-th person wants to play. In a single line print a single integer -- the minimum number of game rounds the friends need to let the i-th person play at least ai rounds. Please, do not use the %lld specifier to read or write 64-bit integers in xd0 xa1++. It is preferred to use the cin, cout streams or the %I64d specifier. You don 't need to know the rules of "Mafia" to solve this problem. If you 're curious, it 's a game Russia got from the Soviet times: http://en.wikipedia.org/wiki/Mafia_(party_game).'...