text: #include <bits/stdc++.h>
  
  using namespace std;
  
  vector<string> split_string(string);
  
  // Complete the miniMaxSum function below.
  void miniMaxSum(vector<int> arr) {
      priority_queue<int> maxQ;
  
      for(int el : arr)
          maxQ.push(el);
  
      long long int max = maxQ.top(), min = 0;
      maxQ.pop();
  
      long long int _toAdd;
      for(int i = 0; i < 3; ++i) {
          _toAdd = maxQ.top();
          maxQ.pop();
          max += _toAdd;
          min += _toAdd;
      }
  
      min += maxQ.top();
      maxQ.pop();
      assert(maxQ.size() == 0);
  
      cout << min << " " << max << endl;
  }
  
  int main()
  {
      string arr_temp_temp;
      getline(cin, arr_temp_temp);
  
      vector<string> arr_temp = split_string(arr_temp_temp);
  
      vector<int> arr(5);
  
      for (int i = 0; i < 5; i++) {
          int arr_item = stoi(arr_temp[i]);
  
          arr[i] = arr_item;
      }
  
      miniMaxSum(arr);
  
      return 0;
  }
  
  vector<string> split_string(string input_string) {
      string::iterator new_end = unique(input_string.begin(), input_string.end(), [] (const char &x, const char &y) {
          return x == y and x == ' ';
      });
  
      input_string.erase(new_end, input_string.end());
  
      while (input_string[input_string.length() - 1] == ' ') {
          input_string.pop_back();
      }
  
      vector<string> splits;
      char delimiter = ' ';
  
      size_t i = 0;
      size_t pos = input_string.find(delimiter);
  
      while (pos != string::npos) {
          splits.push_back(input_string.substr(i, pos - i));
  
          i = pos + 1;
          pos = input_string.find(delimiter, i);
      }
  
      splits.push_back(input_string.substr(i, min(pos, input_string.length()) - i + 1));
  
      return splits;
  }
  