A Word

A - Word _p

Time Limit: 2000MS

Memory Limit: 262144K

64bit IO Format: %I64d& %I64u

[Submit]  [GoBack]   [Status]

Description

Vasya is very upset that many people on the Net mix uppercaseand lowercase letters in one word. That's why he decided to inventan extension for his favorite browser that would change theletters' register in every word so that it either only consisted oflowercase letters or, vice versa, only of uppercase ones. At thatas little as possible letters should be changed in the word. Forexample, theword HoUse must bereplaced with house, and theword ViP —with VIP. If a word contains an equalnumber of uppercase and lowercase letters, you should replace allthe letters with lowercase ones. Forexample, maTRIx shouldbe replaced by matrix. Your task isto use the given method on one given word.

Input

The first line contains a word s — it consistsof uppercase and lowercase Latin letters and possesses the lengthfrom 1 to 100.

Output

Print the corrected word s. If the givenword s has strictlymore uppercase letters, make the word written in the uppercaseregister, otherwise - in the lowercase one.

Sample Input

Input

HoUse

Output

house

Input

ViP

Output

VIP

Input

maTRIx

Output

matrix

#include<iostream>
using namespace std;
int main()
{
        char str[105];
        int i,j;
        int count1,count2;
        while(gets(str))
        {

        for(i=0;i<strlen(str);i++)
        {
                if(str[i]>='A'&&str[i]<='Z')   count1++;
                else     count2++;
        }
                if(count2>=count1)
                        for(j=0;j<strlen(str);j++)
                        {
                                if(str[j]>='A'&&str[j]<='Z')
                                         str[j]=str[j]+32;
                        }
                        else  
                                        for(j=0;j<strlen(str);j++)
                        {
                                if(str[j]>='a'&&str[j]<='z')
                                         str[j]=str[j]-32;
                        }

     for(j=0;j<strlen(str);j++)
            cout<<str[j];
             cout<<endl;
        }
        return 0;
}