str_list = input()
num_list = list()
for i in str_list:
num_list.append(int(i))
num_list = reversed(sorted(num_list))
res = ''
for i in num_list:
res += str(i)
print(res)
import sys
test = [int(sys.stdin.readline()) for _ in range(int(sys.stdin.readline()))]
def make_heap(x):
for k in reversed(range(len(x) // 2)):
heapify(x, len(x), k)
def heapify(x, n, k):
left = 2*k + 1
right = 2 * k + 2
# 부모와 자식간의 크기 비교
if(x[k] > x[left] and left < n):
m = k
else:
m = left
if(right < n and x[m] < x[right]):
m = right
# 부모가 바뀐 경우.
if k != m:
x[k], x[m] = x[m], x[k]
k = m
heapify(x, n, k)
def heap_sort(x):
make_heap(x)
n = len(x)
for k in range(len(x) - 1):
x[0], x[n-1] = x[n-1], x[0]
n = n - 1
heapify(x, n, 0)
heap_sort(test)
for i in test:
print(i)
test = [int(input()) for _ in range(int(input()))]
for i in range(len(test)):
for j in range(len(test) - i - 1):
if(test[j + 1] < test[j]):
temp = test[j + 1]
test[j + 1] = test[j]
test[j] = temp
for i in test:
print(i)
2. pythonic
test = [int(input()) for _ in range(int(input()))]
test = sorted(test)
for i in test:
print(i)
Case = input()
clist = [list(map(int, input().split(' '))) for _ in range(int(Case))]
def gcmf(a, b):
mod = a % b
while(mod > 0):
a = b
b = mod
mod = a % b
return b
for M, N, x, y in clist:
maxv = max(M, N)
minv = min(M, N)
gcm = gcmf(maxv, minv)
lcm = M * N // gcm
cnt = x % (M + 1)
tempY = x
for _ in range(N):
ty = N if tempY % N == 0 else tempY % N
if(ty == y):
break
tempY = ty + M
cnt += M
print(-1 if (cnt > lcm) else cnt)