import java.io.*; import java.sql.ClientInfoStatus; import java.time.Year; import java.util.*; import java.util.concurrent.Executors; import java.util.concurrent.ScheduledExecutorService; import java.util.concurrent.TimeUnit; import java.util.function.BiPredicate; import java.util.function.Function; import java.util.function.IntBinaryOperator; import java.util.function.Predicate; import java.util.stream.Collectors; import java.util.stream.IntStream; import static java.lang.Math.*; import static java.lang.String.format; public class Main { public static void main(String[] args) { solve(); } final static long INF = Long.MAX_VALUE>>2; final static int MOD = 1_000_000_007; final static int[] dx4 = { 0, 1, 0, -1 }; final static int[] dy4 = { 1, 0, -1, 0 }; final static int[] dx9 = {-1, -1, -1, 0, 0, 0, 1, 1,1}; final static int[] dy9 = {-1, 0, 1, -1, 0, 1, -1, 0,1}; final static Runnable me=()->{}; public static void solve(){ //TODO:Solve problem like *** Scanner sc=new Scanner(); String x = sc.next(); List list = new ArrayList<>(); for (char c : x.toCharArray()) { list.add(c); } list.sort(Comparator.reverseOrder()); Permutation.prevPermutation(list, Comparator.naturalOrder()); char[] c = new char[x.length()]; for (int i = 0; i < list.size(); i++) { c[i] = list.get(i); } String xx = String.valueOf(c); if (xx.charAt(0) == '0' || xx.equals(x)) { System.out.println(-1); } else { System.out.println(xx); } System.out.println(); return; } final private static class Permutation { public static int startIndexOfDescendingOrder(int[] p){ //return i //mean p[i-1]p[i+1]>p[i+2]>...>p[p.length] for(int i=p.length-2;i>=0;i--){ if(p[i]-p[i+1]>=0)continue; return i+1; } return 0; } public static int startIndexOfDescendingOrder(T[] p,Comparator comparator){ //return i //mean p[i-1]p[i+1]>p[i+2]>...>p[p.length] for(int i=p.length-2;i>=0;i--){ if(comparator.compare(p[i],p[i+1])>=0)continue; return i+1; } return 0; } public static int startIndexOfDescendingOrder(List list,Comparator comparator){ //return i //mean p[i-1]p[i+1]>p[i+2]>...>p[p.length] for(int i=list.size()-2;i>=0;i--){ if(comparator.compare(list.get(i),list.get(i+1))>=0)continue; return i+1; } return 0; } public static boolean nextPermutation(int[] p) { int firstIndex=startIndexOfDescendingOrder(p); if(firstIndex==0)return false; int ng=p.length; int ok=firstIndex; firstIndex--; while(Math.abs(ng-ok)>1){ int mid=(ng+ok)/2; if(p[mid]>p[firstIndex]){ ok=mid; }else{ ng=mid; } } int t = p[firstIndex]; p[firstIndex] = p[ok]; p[ok] = t; //p[firstIndex+1]以降のものを逆にする firstIndex++; Arrays.sort(p,firstIndex,p.length); return true; } public static boolean nextPermutation(T[] p,Comparator comparator){ int firstIndex=startIndexOfDescendingOrder(p,comparator); if(firstIndex==0)return false; int ng=p.length; int ok=firstIndex; firstIndex--; while(Math.abs(ng-ok)>1){ int mid=(ng+ok)/2; if(comparator.compare(p[mid],p[firstIndex])>0){ ok=mid; }else{ ng=mid; } } T t = p[firstIndex]; p[firstIndex] = p[ok]; p[ok] = t; //p[firstIndex+1]以降のものを逆にする //現在降順で昇順に並べる //ソートのほうが簡潔に書ける firstIndex++; Arrays.sort(p,firstIndex,p.length); return true; } public static boolean nextPermutation(List list,Comparator comparator) { int firstIndex=startIndexOfDescendingOrder(list,comparator); if(firstIndex==0)return false; int ng=list.size(); int ok=firstIndex; firstIndex--; //MGR式 while(Math.abs(ng-ok)>1){ int mid=(ng+ok)/2; if(comparator.compare(list.get(mid),list.get(firstIndex))>0){ //真に大きいならokの領域 ok=mid; }else{ ng=mid; } } T t = list.get(firstIndex); list.set(firstIndex,list.get(ok)); list.set(ok,t); //インデックスがfirstIndex+1以降のものを逆にする firstIndex++; Collections.reverse(list.subList(firstIndex,list.size())); return true; } public static boolean prevPermutation(List list,Comparator comparator){ return nextPermutation(list,comparator.reversed()); } } static class Accepter{ private T val; private final Predicate p; public Accepter(T defaultValue,Predicate p){ this.val=defaultValue; this.p=p; } /** * @return accepted newval? */ public boolean replace(T newVal){ if(p.test(newVal)){ this.val=newVal; return true; } return false; } } //runWhenEAで使う private static Runnable func(Object... objects){ try{ assert false; return me; }catch(AssertionError e){ return ()->{put(objects);}; } } private static void print(Object... objects){ if(objects.length==1){ System.out.print(objects[0]); }else{ System.out.print(Arrays.toString(objects)); } } private static void put(Object... objects) { print(objects); put(); } private static void put(){ System.out.println(); } private static void runWhenEA(Runnable runnable){ try{ assert false; }catch(AssertionError e){ PrintStream ps=System.out; PrintStream pse=System.err; System.setOut(pse); runnable.run(); System.setOut(ps); } } private static void putM(String name,char[][] mat){ put("---------------------"+name+"-----------------"); for (int i = 0; i < mat.length; i++) { put(Arrays.toString(mat[i])); } } private static void putM(String name,int[][] mat){ put("---------------------"+name+"-----------------"); for (int i = 0; i < mat.length; i++) { put(Arrays.toString(mat[i])); } } private static void putM(String name,long[][] mat){ put("---------------------"+name+"-----------------"); for (int i = 0; i < mat.length; i++) { put(Arrays.toString(mat[i])); } } private static void putM(String name,boolean[][] mat){ put("---------------------"+name+"-----------------"); for (int i = 0; i < mat.length; i++) { put(Arrays.toString(mat[i])); } } final static private class Scanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; } else { ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } public boolean hasNext() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while (true) { if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; } else if (b == -1 || !isPrintableChar(b)) { return minus ? -n : n; } else { throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next()); } } static private class FixedIntPair { final public int x, y; final static public FixedIntPair ZEROS=new FixedIntPair(0,0); FixedIntPair(int x, int y) { this.x = x; this.y = y; } @Override public String toString() { return format(FixedIntPair.class.getSimpleName()+":(%d,%d)", x, y); } } final static private class FixedLongPair { final public long x, y; final static public FixedLongPair ZEROS=new FixedLongPair(0,0); FixedLongPair(long x, long y) { this.x = x; this.y = y; } @Override public int hashCode() { return (int)x+(int)y; } @Override public boolean equals(Object obj) { if(obj==null)return false; if(!(obj instanceof FixedLongPair)) return false; FixedLongPair pair=(FixedLongPair)obj; return this.x==pair.x&&this.y==pair.y; } @Override public String toString() { return format(FixedLongPair.class.getSimpleName()+":(%d,%d)", x, y); } } final static private class Binary{ public static String toZeroPadding(int i){ return format("%"+Integer.toBinaryString(-1).length()+"s",Integer.toBinaryString(i)).replace(' ','0'); } public static String toZeroPadding(long i){ return format("%"+Long.toBinaryString(-1).length()+"s",Long.toBinaryString(i)).replace(' ','0'); } } public static class BinaryIndexedTree { public static void main(String... args){ int a[]={1,3,2,5,7,6,4}; System.out.println(inv(a)); } final int n; final long[] array; BinaryIndexedTree(long[] array){ this.n=array.length; this.array=new long[n]; for(int i=0;i=0;index=(index&(index+1))-1){ result+=array[index]; } return result; } /** * * @param array arrayが1~nの順列になっていないならば定義されない * @return 転倒数 */ public static int inv(int[] array){ int[] a=new int[array.length]; BinaryIndexedTree bit=new BinaryIndexedTree(a); bit.add(array[0]-1,1); int result=0; for(int i=1;i=0&&i=0&&j