import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write

X=list(readline().rstrip())
X.sort(reverse=True)
N=len(X)
for n in range(N-2,-1,-1):
    if X[n]!=X[n+1]:
        X[n],X[n+1]=X[n+1],X[n]
        break
else:
    print(-1)
    exit()
if X[0]=="0":
    print(-1)
    exit()
print(*X,sep="")