#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("Yes");}else{puts("No");} #define MAX_N 200005 int main() { string s[3]; string line; getline(cin, line); int i = 0; while(i < 3){ getline(cin, line); s[i] = line; i++; rep(j,line.size()){ if(line[j] == ' '){ cout << "\"assert\"" << endl; return 0; } } } ll a[3] = {}; rep(i,3){ rep(j,s[i].size()){ a[i] = a[i] * 10 + s[i][j] - '0'; } } sort(a,a+3); if(a[0] == a[1]) cout << a[0] + a[1] << endl; else cout << a[0] + a[2] << endl; return 0; }