#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
typedef long long LL;
using namespace std;

int main(){
    int a,b,c;
    cin >> a >> b >> c;
    cout << 21 - a - b - c << endl;
}
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;



#define MOD 1000000007
#define vi vector<int>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define INF (int)1e9
#define fora(i,a,b) for(ll i=a;i<b;i++)
#define forn(n) for(ll i=0; i<n; i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fir first
#define sec second
#define si size()
#define be begin()
#define en end()
#define le length()
#define mp(x,y) make_pair(x,y)
#define mli map<ll,int>
#define mll map<ll,ll>
#define umll unordered_map<ll,ll>
#define p0(a) cout << a << " "
#define p1(a) cout << a << endl
#define sortv(v) sort(v.begin(), v.end())
#define minv(v) min_element(v.begin(), v.end())
#define maxv(v) max_element(v.begin(), v.end())
#define ubv(v,n) upper_bound(v.begin(), v.end(), n)
#define lbv(v,n) lower_bound(v.begin(), v.end(), n)
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")

#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)

ll gcd(ll a,ll b){
    if (b==0)return a;
    return gcd(b,a%b);
    
}


int main()
{
fast;
ll t;
//cin>>t;
t=1;
for(ll tc=1;tc<=t;tc++)
{
ll a,b,c;
cin>>a>>b>>c;
cout<<21-a-b-c;
}
    return 0;
}
//0xAAAAAAAA=even bits set to 1 ; 0x55555555 = odd bits set to 1