#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

const int MAX = 26;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    string S;
    cin >> S;

    int n = S.size();
    vector<vector<int>> dp(n + 1, vector<int>(MAX + 1, 0));
    for (int i = n - 1; i >= 0; i--) {
        for (int j = 0; j < MAX; j++) dp[i][j] = dp[i + 1][j];
        if (S[i] == '?') continue;
        int c = S[i] - 'a';
        for (int j = 0; j <= c; j++) dp[i][j] = max(dp[i][j], dp[i + 1][c + 1] + 1);
    }

    int LIS = 1;
    for (int j = 0; j <= MAX; j++) LIS = max(LIS, dp[0][j]);
    vector<int> pre(MAX, 0);

    for (int i = 0; i < n; i++) {
        if (S[i] == '?') {
            for (int j = 0; j < MAX; j++) {
                if (pre[j] + 1 + dp[i + 1][j + 1] <= LIS) {
                    S[i] = char('a' + j);
                    break;
                }
            }
        }
        int c = S[i] - 'a';
        for (int j = c + 1; j < MAX; j++) pre[j] = max(pre[j], pre[c] + 1);
    }

    cout << S << '\n';
    return 0;
}

// int main() {
//     string S;
//     cin >> S;
//     auto rdp = make_v<int, 2>(26 + 1, n + 1);
//     repR(i, n) {
//         if (s[i] == '?') {
//             rep(c, 26) rdp[c][i] = rdp[c][i + 1];
//         } else {
//             int d = s[i] - 'a';
//             rep(c, 26) {
//                 rdp[c][i] = rdp[c][i + 1];
//                 if (c <= d) chmax(rdp[c][i], 1 + rdp[d + 1][i + 1]);
//             }
//         }
//     }
//     int LIS = 1;
//     rep(c, 26 + 1) chmax(LIS, rdp[c][0]);
//     dump(LIS);

//     vector<int> ldp(26 + 1);
//     rep(i, n) {
//         if (s[i] == '?') {
//             rep(c, 26) {
//                 if (ldp[c] + 1 + rdp[c + 1][i + 1] <= LIS) {
//                     s[i] = 'a' + c;
//                     break;
//                 }
//             }
//             assert(s[i] != '?');
//         }

//         int d = s[i] - 'a';
//         rep(c, 26 + 1) if (c > d) { chmax(ldp[c], ldp[d] + 1); }
//     }

//     cout << s << '\n';

//     assert(*max_element(all(ldp)) == LIS);
// }