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

using namespace std;

#define ll long long int
#define ld long double

#define fori(a, b) for(ll i=a; i<b; i++)
#define forj(a, b) for(ll j=a; j<b; j++)
#define fork(a, b) for(ll k=a; k<b; k++)
#define forr(a, b) for(ll r=a; r>=b; r--)

#define forv(vec) for(auto &val: vec)

#define re return
#define nl cout<<endl

#define st set<long long>
#define mp map<long long, long long>
#define pll pair<long long, long long>
#define vll vector<long long>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define vvll vector< vector<long long>>
#define vpll vector< pair<long long, long long>>

#define pb push_back
#define pp pop_back
#define fs first
#define sc second
#define all(vec) vec.begin(), vec.end()
#define allr(vec) vec.rbegin(), vec.rend()
#define sorta(vec) sort(all(vec))
#define sortd(vec) sort(vec.begin(), vec.end(), [](long long a, long long b){return a>b;})

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;
}

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

void solve(){
int sum=55;
for(int i=0;i<9;i++){
    ll x;
    cin>>x;
   sum-=x;
    }
    cout<<sum;
}
int main(){
    enter
    int t=1;
    //cin>>t;
    while(t--){
        solve();
        nl;
    }
    return 0;
}