//
//
// File Creation Date:
// Author: Gourav(https://github.com/GouravKhunger)

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<ll> vll;
typedef set<int> si;
typedef priority_queue<int> pq;
typedef priority_queue<int,vector<int>,greater<int>> pqs;

#define F first
#define S second
#define PB push_back
#define MP make_pair
#define FOR(i, a, b) for (int i=a; i<=b; i++)
#define FORn(i, a, b) for (int i=a; i>=b; i--)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define rng_init mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)

const int MOD = 1e9+7;
const ll INF = 1e15;

int main() {
	FIO;

    //start here

	int a, b, c;
	cin>>a>>b>>c;
	
	cout<<(7-a)+(7-b)+(7-c);

    //end here

    return 0;
}

//----AUTHOR:kkdrummer----/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#include <boost/multiprecision/cpp_int.hpp> 
//using namespace boost::multiprecision; 
using namespace __gnu_pbds;
using namespace std;
typedef    long long                     ll;
typedef    long double                   ld;
typedef    unordered_set<ll>              usll;
typedef    unordered_multiset<ll>         umsll;
typedef    multiset<ll>                   msll;
typedef    set<ll>                       sll;
typedef    vector<ll>                    vll;
typedef    pair<ll,ll>                   pll;
typedef    vector<pll>                   vpll;
typedef    priority_queue<ll>            pqll;
typedef    vector<int>                   vi;
typedef    set<int>                      si;
typedef    multiset<int>                 msi;
typedef    unordered_multiset<int>       umsi;
typedef    unordered_set<int>            usi;
typedef    pair<int,int>                    pi;
typedef    vector<pi>                     vpi;
typedef    priority_queue<int>            pqi;
typedef    tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>   ind_si;
typedef    tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>   ind_sll;
typedef    tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>   ind_msi;
typedef    tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update>   ind_msll;
#define    in                  insert
#define    fi                  first
#define    se                  second
#define    pb                  push_back
#define    mp                  make_pair
#define    be                  begin
#define    en                  end
#define    itr                 iterator
#define    io                  ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define    mo                  1000000007
#define    inf                 8222372026854775807
#define    ninf                  -inf
#define    ima                  2047483647
#define    imi                  -ima
#define    oncnt               __builtin_popcount
#define    zerobegin           __builtin_clz
#define    zeroend            __builtin_ctz
#define    parity              __builtin_parity
#define    eps                 1e-9
#define    coutd               cout<<setprecision(10)<<fixed
#define    mems(dp,x)          memset(dp,x,sizeof(dp))
#define    fbo                 find_by_order
#define    ook                   order_of_key
#define    all(x)              x.be(),x.en()
#define    upb                   upper_bound
#define    lowb                 lower_bound 
#define    lte(v,x)            (upb(all(v),x)-v.be())
#define    gte(v,x)            (v.end()-lowb(all(v),x))
#define    gt(v,x)             (v.en()-upb(all(v),x))
#define    lt(v,x)             (lowb(all(v),x)-v.be())
const      ld PI=             3.1415926535897932384626433832792884197169399375105820974944;
inline ll mpow(ll x,ll n){if(n==0)return 1;if(x==0)return 0;if(n==1)return(x%mo);ll u=(mpow(x,n/2));u=(u*u)%mo;if(n%2!=0)u=(u*x%mo)%mo;return u;}
inline ll minv(ll x){return mpow(x,mo-2);}
inline ll mmul(ll a,ll b){if(a>=mo)a=a%mo;if(b>=mo)b=b%mo;if(a*b>=mo)return(a*b)%mo;return(a*b);}
inline ll madd(ll a, ll b){if(a>=mo)a=a%mo;if(b>=mo)b=b%mo;if(a+b>=mo)return(a+b)%mo;return(a+b);}
inline ll msub(ll a, ll b){if(a>=mo)a=a%mo;if(b>=mo)b=b%mo;return(((a-b)%mo+mo)%mo);}
inline ll mdiv(ll a,ll bb){if(a>=mo)a=a%mo;ll b=minv(bb);if(b>=mo)b=b%mo;if(a*b>=mo)return(a*b)%mo;return(a*b);}
inline ll gcd(ll a,ll b){return __gcd(a,b);}
inline ll lcm(ll a,ll b){return (a*b)/gcd(a,b);}
// printf("%.0Lf",ans); // for printing 10^19 order ld numbers










int main()
{              io 
int testcases=1;         //         cin>>testcases;
while(testcases--)
{


int a,b,c;
cin>>a>>b>>c;
cout<<21-a-b-c;































































}return 0;}