#include <bits/stdc++.h>
using namespace std;
int cnt1[10], cnt2[10];
int check() {
  int count = 0;
  int remz = 1 << 20;
  for (int i = 0; i < 10; i++) {
    int pairs = min(cnt1[i], cnt2[9 - i]);
    if (i == 0) remz = min(remz, cnt1[i] - pairs);
    if (i == 9) remz = min(remz, cnt2[i] - pairs);
    count += pairs;
  }
  return count + remz;
}
int main() {
  string s;
  cin >> s;
  for (int i = 0; i < s.size(); i++) cnt1[s[i] - '0'] += 1;
  for (int i = 0; i < 10; i++) cnt2[i] = cnt1[i];
  int bkill = -1, maxcnt = 0;
  for (int i = 1; i < 10; i++)
    if (cnt1[i] != 0 && cnt2[10 - i] != 0) {
      cnt1[i] -= 1;
      cnt2[10 - i] -= 1;
      int ret = check() + 1;
      if (ret > maxcnt) {
        bkill = i;
        maxcnt = ret;
      }
      cnt1[i] += 1;
      cnt2[10 - i] += 1;
    }
  if (bkill == -1) {
    for (int i = 10; i >= 0; i--) {
      while (cnt1[i] > 0) {
        cout << i;
        cnt1[i] -= 1;
      }
    }
    cout << endl;
    for (int i = 10; i >= 0; i--) {
      while (cnt2[i] > 0) {
        cout << i;
        cnt2[i] -= 1;
      }
    }
    cout << endl;
    return 0;
  }
  vector<int> n1, n2;
  n1.push_back(bkill);
  n2.push_back(10 - bkill);
  cnt1[bkill] -= 1;
  cnt2[10 - bkill] -= 1;
  for (int i = 0; i < 10; i++) {
    int del = min(cnt1[i], cnt2[9 - i]);
    for (int j = 0; j < del; j++) n1.push_back(i);
    for (int j = 0; j < del; j++) n2.push_back(9 - i);
    cnt1[i] -= del;
    cnt2[9 - i] -= del;
  }
  for (int i = 1; i < 10; i++) {
    while (cnt1[i] > 0) {
      n1.push_back(i);
      cnt1[i] -= 1;
    }
    while (cnt2[i] > 0) {
      n2.push_back(i);
      cnt2[i] -= 1;
    }
  }
  reverse(n1.begin(), n1.end());
  reverse(n2.begin(), n2.end());
  for (int i = 0; i < min(cnt1[0], cnt2[0]); i++) {
    n1.push_back(0);
    n2.push_back(0);
  }
  int del = min(cnt1[0], cnt2[0]);
  cnt1[0] -= del;
  cnt2[0] -= del;
  for (int i = 0; i < cnt1[0]; i++) cout << 0;
  for (auto x : n1) cout << x;
  cout << endl;
  for (int i = 0; i < cnt2[0]; i++) cout << 0;
  for (auto x : n2) cout << x;
  cout << endl;
  return 0;
}
