#include using namespace std; typedef long long ll; #define rep(i,n) for(int i=0;i>s; int len=s.length(); vectorvec; rep(i,len){ vec.push_back(s[i]-'0'); } sort(vec.begin(),vec.end(),greater()); if(!prev_permutation(vec.begin(),vec.end())){ cout<<-1<