#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <unordered_set>
#include <queue>
#include <numeric>
#include <stack>

using namespace std;

#define ll long long int
#define ld long double

#define forr(i, a, b) for(ll i=a; i<b; i++)
#define forn(i, a, b) for(ll i=a-1; i>=b; i--)
#define forv(vec) for(auto &val: vec)

#define re return
#define nl '\n'

#define st set<long long>
#define queue queue<long long>
#define stack stack<long long>
#define mp map<long long, long long>
#define maxpq priority_queue<ll>
#define minpq priority_queue<ll, vector<ll>, greater<ll>>
#define pll pair<long long, long long>
#define bits(n) bitset<n> //set reset flip test
#define vll vector<long long>
#define vb vector<bool>
#define vch vector<char>
#define vstr vector<string>
#define vvll vector< vector<long long>>
#define vvch vector< vector<char>>
#define vvstr vector< vector<string>>
#define vvb vector< vector<bool>>
#define vpll vector< pair<long long, long long>>

#define pb push_back
#define pop pop_back
#define fs first
#define sc second
#define all(vec) vec.begin(), vec.end()
#define allr(vec) vec.rbegin(), vec.rend()
#define fill_iota(vec, val) iota(all(vec), val)
#define sorta(vec) sort(all(vec))
#define sortd(vec) sort(vec.begin(), vec.end(), [](long long a, long long b){return a>b;})
#define uni(vec) unique(all(vec)) // moves consecutive same elements to last indexes and returns it from which only same element remains
#define permu(vec) next_permutation(all(vec))
#define best_search(vec, x) binary_search(all(vec), x)
#define lower(vec, x) lower_bound(all(vec), x)
#define upper(vec, x) upper_bound(all(vec), x)
//gcd(a, b) or lcm(a, b)
#define arr_product(vec) accumulate(all(vec), 0LL, [](ll a, ll b){ return a * b; })
#define arr_sum(vec) accumulate(all(vec), 0LL)

ostream& operator<<(ostream &out, const vll &vec){
    for(auto &val: vec) out<<val<<" ";
    return out;
}

istream& operator>>(istream &in, vll &vec){
    for(auto &val: vec) in>>val;
    return in;
}

istream& operator>>(istream &in, pll &p) {
    in >> p.first >> p.second;
    return in;
}

ostream& operator<<(ostream &out, pll &p) {
    out << p.first << p.second;
    return out;
}

bool isPrime(ll n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 || n % 3 == 0) return false; for (ll i = 5; i*i <= n; i += 6)
if (n % i == 0 || n % (i+2) == 0) return false; return true;}

#define enter ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);

void solve(){
    forr(i, 0, 10){
        ll x;
        cin>>x;
        if(x!=i+1){
            cout<<i+1;
            i++;
        }
    }
}

int main(){
    enter
    int t=1;
    // cin>>t;
    while(t--){
        solve();
        cout << nl;
    }
    return 0;
}