#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

int main()
{
    const vector<unsigned char> tmp = {0xEF, 0xBD, 0x97};

    vector<vector<unsigned char> > s;
    int len = 0;
    int maxLen = 0;
    for(;;){
        vector<unsigned char> v(1);
        if(!(cin >> v[0]))
            break;

        int n = 0;
        while(v[0] & (1 << (7 - n)))
            ++ n;
        n = max(n, 1);

        v.resize(n);
        for(int i=1; i<n; ++i)
            cin >> v[i];
        s.push_back(v);

        if(v == tmp){
            ++ len;
            if(len != s.size())
                maxLen = max(maxLen, len);
        }
        else{
            len = 0;
        }
    }

    if(maxLen == 0)
        return 0;

    vector<vector<vector<unsigned char> > > ans;
    int i = s.size() - 1;
    while(i >= 0){
        int j = i;
        while(j >= 0 && s[j] == tmp)
            -- j;

        int k = j;
        while(k >= 0 && s[k] != tmp)
            -- k;

        if(i - j == maxLen && j - k > 0){
            vector<vector<unsigned char> > v(s.begin() + 1 + k, s.begin() + 1 + j);
            ans.push_back(v);
        }
        i = k;
    }
    reverse(ans.begin(), ans.end());

    for(unsigned i=0; i<ans.size(); ++i){
        for(unsigned j=0; j<ans[i].size(); ++j){
            for(unsigned k=0; k<ans[i][j].size(); ++k){
                cout << ans[i][j][k];
            }
        }
        cout << endl;
    }

    return 0;
}