n = gets.chomp
L = n.length

for i in 0..(L-2) do
  max, idx = "0", nil
  for j in (i+1)..(L-1) do
    max, idx = n[j], j if n[j] >= max
  end
  
  if idx && n[i] < n[idx] then
    n[i], n[idx] = n[idx], n[i]
    break
  end
end

puts n