A flea is sitting at one of the *n* hassocks, arranged in a circle, at the moment. After minute number *k* the flea jumps through *k* - 1 hassoсks (clockwise). For example, after the first minute the flea jumps to the neighboring hassock. You should answer: will the flea visit all the hassocks or not. We assume that flea has infinitely much time for this jumping.
The only line contains single integer: 1 ≤ *n* ≤ 1000 — number of hassocks.
s=input()
count=0
count1=0
for i in range(len(s)):
                         if s[i] in s.lower():
                                                  count+=1
                         
                         elif s[i] in s.upper():
                                                  count1+=1
                         
                         
                         
if count>count1:
                         s=s.lower()
                         print(s)
                         
else:
                         s=s.upper()
                         print(s)