import sys
from collections import Counter
string = input()
cnt = Counter(string)
new = {
'y': cnt['y'],
'o': cnt['o'],
'u': cnt['u']
}
nums = min(new.values())
res = 'you' * nums
for k, v in cnt.items():
if k in 'you' and v > nums:
# print(k,v)
res += str(k) * (v-nums)
elif k not in 'you':
res += str(k) * v
print(res)
# 暴力会超时间,用正反序前缀和,空间换时间
import sys
n = int(input())
nums = list(map(int, input().split()))
sorted_nums = sorted(nums)
left = [0] * n
cum = 0
for i in range(n):
cum += sorted_nums[i]
left[i] = cum
right = [0] * n
cum = 0
for i in range(n-1, -1, -1):
cum += sorted_nums[i]
right[i] = cum
hashmp = dict()
for i in range(n):
if sorted_nums[i] in hashmp:
continue
if i > 0:
ops_left = sorted_nums[i] * i - left[i-1]
else:
ops_left = 0
if i < n-1:
ops_right = right[i+1] - sorted_nums[i] * (n-i-1)
else:
ops_right = 0
hashmp[sorted_nums[i]] = ops_left + ops_right
for i in nums:
print(hashmp[i])
import sys
import re
array = input()
new_pairs = re.findall(r'([-\d]+)\(([\d]+)\)', array)
res = '['
i, n = 0, len(new_pairs)
while i < n:
key = new_pairs[i][0]
val = int(new_pairs[i][1])
idx = i + 1
while idx < n and new_pairs[idx][0] == key:
val += int(new_pairs[idx][1])
idx += 1
i = idx
if i != n:
res += str(key)+'('+str(val)+')'+','
else:
res += str(key)+'('+str(val)+')'+']'
print(res)
#携程##算法##笔试#