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()
c=0
c1=0
for i in s:
    if(i.islower()):
        c+=1
    if(i.isupper()):
        c1+=1
if(c==c1 or c>c1):
    print(s.lower())
else:
    print(s.upper())
