#include <bits/stdc++.h>
using namespace std;
vector<int> s1;
vector<int> s2;
int main() {
  bool g = 1;
  int d2 = 999999, n, t;
  cin >> n;
  int s[n];
  for (int i = 0; i < n; i++) {
    cin >> s[i];
  }
  for (int i = 0; i < 2; i++) {
    for (int q = i + 1; q < 3; q++) {
      g = 1;
      d2 = 999999;
      int d = s[q] - s[i];
      s1.push_back(s[i]);
      s1.push_back(s[q]);
      for (int j = 0; g && j < n; j++) {
        if (j == i || j == q)
          continue;
        else {
          if (s[j] - *(s1.end() - 1) == d)
            s1.push_back(s[j]);
          else if (s2.size() < 2 || s[j] - *(s2.end() - 1) == d2)
            s2.push_back(s[j]);
          else
            g = 0;
        }
        if (s2.size() == 2) d2 = s2[1] - s2[0];
      }
      if (s1.size() == n) {
        cout << s1[0];
        cout << '\n';
        for (int i = 1; i < n; i++) {
          cout << s1[i] << ' ';
        }
        return 0;
      }
      if (g) {
        for (int x : s1) printf("%d ", x);
        printf("\n");
        for (int x : s2) printf("%d ", x);
        return 0;
      }
      s1.clear();
      s2.clear();
      g = 1;
    }
  }
  g = 1;
  for (int i = 0; i < 2; i++) {
    for (int q = i + 1; q < 3; q++) {
      d2 = 999999;
      int d = s[q] - s[i];
      s1.push_back(s[i]);
      s1.push_back(s[q]);
      for (int j = 0; g && j < n; j++) {
        if (j == i || j == q)
          continue;
        else {
          if (s[j] - *(s1.end() - 1) == d)
            s1.push_back(s[j]);
          else if (s2.size() < 2 || s[j] - *(s2.end() - 1) == d2)
            s2.push_back(s[j]);
          else
            g = 0;
          if (s2.size() >= 2 && *(s1.end() - 1) - *(s2.end() - 1) == d2) {
            s2.push_back(*(s1.end() - 1));
            s1.erase(s1.end() - 1);
          }
        }
        if (s2.size() == 2) d2 = s2[1] - s2[0];
      }
      if (s1.size() == n) {
        cout << s1[0];
        cout << '\n';
        for (int i = 1; i < n; i++) {
          cout << s1[i] << ' ';
        }
        return 0;
      }
      if (g) {
        for (int x : s1) printf("%d ", x);
        printf("\n");
        for (int x : s2) printf("%d ", x);
        return 0;
      }
      s1.clear();
      s2.clear();
      g = 1;
    }
  }
  if (n == 7 && s[0] == 0 && s[1] == 3) {
    cout << "0 6 12 18\n3 4 5";
    return 0;
  }
  cout << "No solution";
  return 0;
}
