s=input()
c=0
sm=0
for i in s:
if i.isupper():
c+=1
else:
sm+=1
if c>sm:
print(s.upper())
else:
print(s.lower())
#include<iostream>
#include<string>
using namespace std;
int main()
{
string s;
cin>>s;
int a=0,A=0;
for(auto x:s)
{ if(isupper(x))
{
A++;
}
if(islower(x))
{
a++;
}
}
if(A<=a)
{
for(int i=0;i<s.size();i++)
{
if(isupper(s[i]))
{
s[i]=tolower(s[i]);
}
}
}
else if(A>a)
{
for(int i=0;i<s.size();i++)
{
if(islower(s[i]))
{
s[i]=toupper(s[i]);
}
}
}
cout<<s<<endl;
return 0;
}1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |
1299. Replace Elements with Greatest Element on Right Side | 1768. Merge Strings Alternately |
561. Array Partition I | 1374. Generate a String With Characters That Have Odd Counts |
1822. Sign of the Product of an Array | 1464. Maximum Product of Two Elements in an Array |
1323. Maximum 69 Number | 832. Flipping an Image |
1295. Find Numbers with Even Number of Digits | 1704. Determine if String Halves Are Alike |
1732. Find the Highest Altitude | 709. To Lower Case |
1688. Count of Matches in Tournament | 1684. Count the Number of Consistent Strings |
1588. Sum of All Odd Length Subarrays | 1662. Check If Two String Arrays are Equivalent |
1832. Check if the Sentence Is Pangram | 1678. Goal Parser Interpretation |
1389. Create Target Array in the Given Order | 1313. Decompress Run-Length Encoded List |
1281. Subtract the Product and Sum of Digits of an Integer | 1342. Number of Steps to Reduce a Number to Zero |
1528. Shuffle String | 1365. How Many Numbers Are Smaller Than the Current Number |
771. Jewels and Stones | 1512. Number of Good Pairs |