#include <bits/stdc++.h>  // {{{

// https://codeforces.com/blog/entry/96344

#pragma GCC optimize("O2,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

using namespace std;

template <typename T>
constexpr T MIN = std::numeric_limits<T>::min();

template <typename T>
constexpr T MAX = std::numeric_limits<T>::max();

template <typename T>
[[nodiscard]] static T sc(auto&& x) {
  return static_cast<T>(x);
}

template <typename T>
[[nodiscard]] static T sz(auto&& x) {
  return static_cast<T>(x.size());
}

template <typename... Args>
void pr(std::format_string<Args...> fmt, Args&&... args) {
  std::print(fmt, std::forward<Args>(args)...);
}

template <typename... Args>
void pr(std::format_string<Args...> fmt) {
  std::print(fmt);
}

template <typename... Args>
void prln(std::format_string<Args...> fmt, Args&&... args) {
  std::println(fmt, std::forward<Args>(args)...);
}

template <typename... Args>
void prln(std::format_string<Args...> fmt) {
  std::println(fmt);
}

void prln() {
  std::println();
}

void prln(auto const& t) {
  std::println("{}", t);
}

using ll = long long;
using ld = long double;
template <typename T>
using vec = std::vector<T>;

#define ff first
#define ss second
#define eb emplace_back
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
//  }}}

void solve() {
  int n;
  cin >> n;
  vec<array<array<int, 5>, 5>> cards(n);
  vec<array<bitset<3001>, 5>> bitsets(n);
  vec<vec<int>> val_to_row(n, vec<int>(3001, -1));

  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < 5; ++j) {
      for (auto& value : cards[i][j]) {
        cin >> value;
        val_to_row[i][value] = j;
        bitsets[i][j][value] = true;
      }
    }
  }

  for (int i = 0; i < n; ++i) {
    for (int j = i + 1; j < n; ++j) {
      for (int k = 0; k < 5; ++k) {
        for (auto& value : cards[i][k]) {
          if (val_to_row[j][value] == -1)
            continue;
          auto both = bitsets[i][k] | bitsets[j][val_to_row[j][value]];
          both[value] = false;

          bool bad = false;
          for (int c = 0; c < n && !bad; ++c) {
            if (c == i || c == j)
              continue;
            for (int d = 0; d < 5; ++d) {
              if ((bitsets[c][d] & both).count() == 5) {
                bad = true;
                break;
              }
            }
          }

          if (!bad) {
            cout << value << endl;
            cout << i + 1 << ' ' << j + 1 << endl;
            return;
          }
        }
      }
    }
  }

  prln("no ties");
}

int main() {  // {{{
  cin.tie(nullptr)->sync_with_stdio(false);

  int t = 1;
  // cin >> t;

  while (t--) {
    solve();
  }

  return 0;
}
// }}}
