#include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define MOD 1000000007
#define FOR(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define ALL(x) (x).begin(),(x).end()
typedef long long ll;

int main() {
  char c;
  string s;
  ll p[3];
  scanf("%*s%*[\n]");
  for(int i = 0; i < 3;){
    scanf("%c", &c);
    if(c == ' ') {
      cout << "\"assert\"" << endl;
      return 0;
    }
    if(c == '\n') {
      i++;
    }
    s += c;
  }
  sscanf(&s[0], "%d%d%d", p, p + 1, p + 2);
  if(p[0] == p[1]) {
    cout << ((p[0] * 2 < p[0] + p[2]) ? p[0] * 2 : p[0] + p[2]) << endl;
    return 0;
  } else {
    ll a[3], q[3];
    a[0] = p[0] + p[1];
    a[1] = p[1] + p[2];
    a[2] = p[2] + p[0];
    q[0] = a[0] < a[1];
    q[1] = a[1] < a[2];
    q[2] = a[2] < a[0];
    if(a[0] == a[1]) {
      cout << ((a[0] < a[2]) ? a[0] : a[2]);
    } else if(a[1] == a[2]) {
      cout << ((a[1] < a[0]) ? a[1] : a[0]);
    } else if(a[2] == a[0]) {
      cout << ((a[2] < a[1]) ? a[2] : a[1]);
    } else if(q[0] == q[2]) {
      cout << a[0] << endl;
    } else if(q[0] == q[1]) {
      cout << a[1] << endl;
    } else if(q[1] == q[2]) {
      cout << a[2] << endl;
    }
  }
  return 0;
}