#include using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define rep2(i, x, n) for(int i = x; i <= n; i++) #define rep3(i, x, n) for(int i = x; i >= n; i--) #define each(e, v) for(auto &e: v) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)x.size() using ll = long long; using pii = pair; using pil = pair; using pli = pair; using pll = pair; const int MOD = 1000000007; //const int MOD = 998244353; const int inf = (1<<30)-1; const ll INF = (1LL<<60)-1; template bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;}; template bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;}; struct io_setup{ io_setup(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; int main(){ string S; cin >> S; int N = sz(S); vector id(N, -1); int K = 0; int R = 0; rep(i, N){ if(S[i] != '?') R++; } for(; R > 0; K++){ int x = 0; rep3(i, N-1, 0){ if(S[i] == '?' || id[i] != -1) continue; if(S[i]-'a' >= x){ id[i] = K; x = S[i]-'a'; R--; } } } if(K == 0){ cout << string(N, 'a') << '\n'; return 0; } vector c(K, 0); rep3(i, N-1, 0){ if(id[i] == -1){ int m = *min_element(all(c)); S[i] = char('a'+m); } else{ c[id[i]] = S[i]-'a'; } } cout << S << '\n'; }