#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
#include <cmath>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i=0;i < (int)(n);i++)

int main(){
    string s;
    cin >> s;
    for (int i = 0; i < int(s.size());i++){
        if (s[i] != 'a'){
            s.replace(i,1,"");
        }
    }
    cout << s+"a" << endl;
    

    return 0;
}