#include <bits/stdc++.h>
using namespace std;
template <class htpe, class cmp>
using heap = priority_queue<htpe, vector<htpe>, cmp>;
template <class htpe>
using min_heap = heap<htpe, greater<htpe> >;
template <class htpe>
using max_heap = heap<htpe, less<htpe> >;
const int INF = 1791791791;
const long long INFLL = 1791791791791791791ll;
template <int input_buf_size, int output_buf_size>
class FastIO {
  char cbuf[input_buf_size + 1];
  int icur = 0;
  inline bool go_to_next_token() {
    while (cbuf[icur] == ' ' || cbuf[icur] == '\n') icur++;
    while (cbuf[icur] == 0) {
      icur = 0;
      if (fgets(cbuf, sizeof(cbuf), stdin) != cbuf) return false;
      while (cbuf[icur] == ' ' || cbuf[icur] == '\n') icur++;
    }
    return true;
  }

 public:
  string readString() {
    assert(go_to_next_token());
    string ans;
    while (cbuf[icur] != ' ' && cbuf[icur] != '\n' && cbuf[icur] != 0)
      ans.push_back(cbuf[icur++]);
    ans.shrink_to_fit();
    return ans;
  }
  template <class int_type>
  int_type readInt() {
    assert(go_to_next_token());
    int_type x = 0;
    bool m = cbuf[icur] == '-';
    if (m) icur++;
    while ('0' <= cbuf[icur] && cbuf[icur] <= '9') {
      x *= 10;
      x += (cbuf[icur] - '0');
      icur++;
    }
    if (m) x = -x;
    return x;
  }
  bool seekEof() { return !go_to_next_token(); }

 private:
  char obuf[output_buf_size + 1];
  int ocur = 0;
  inline void write_string(const char *str, size_t sz = 0) {
    if (sz == 0) sz = strlen(str);
    if (ocur + sz > output_buf_size) {
      fputs(obuf, stdout);
      fputs(str, stdout);
      ocur = 0;
      obuf[0] = 0;
      return;
    }
    strcpy(obuf + ocur, str);
    ocur += sz;
    obuf[ocur] = 0;
  }

 public:
  template <class int_type>
  void writeInt(int_type x, bool sp = true) {
    char buf[20];
    int c = 0;
    if (x < 0) {
      buf[c++] = '-';
      x = -x;
    }
    int s = c;
    if (x == 0) {
      buf[c++] = '0';
    }
    while (x > 0) {
      buf[c++] = (x % 10) + '0';
      x /= 10;
    }
    for (int i = 0; 2 * i < c - s; i++) {
      swap(buf[s + i], buf[c - 1 - i]);
    }
    buf[c] = 0;
    write_string(buf, c);
    if (sp) write_string(" ", 1);
  }
  void writeString(string s, bool space = true) {
    write_string(s.c_str(), s.size());
    if (space) write_string(" ", 1);
  }
  void writeEndl() { write_string("\n", 1); }
  void flush() {
    fputs(obuf, stdout);
    ocur = 0;
    obuf[0] = 0;
  }

 private:
  bool lflush;

 public:
  FastIO(bool local_flush) {
    obuf[0] = 0;
    lflush = local_flush;
  }
  ~FastIO() { fputs(obuf, stdout); }
};
FastIO<10000000, 10000000> IO(true);
int prob_score(int t, int succ, int total) {
  int max_score;
  if (succ * 32 <= total)
    max_score = 12;
  else if (succ * 16 <= total)
    max_score = 10;
  else if (succ * 8 <= total)
    max_score = 8;
  else if (succ * 4 <= total)
    max_score = 6;
  else if (succ * 2 <= total)
    max_score = 4;
  else
    max_score = 2;
  return max_score * (250 - t);
}
int n;
int a[5];
int b[5];
int succ[5];
bool can(int num_new) {
  int diff = 0;
  for (int i = 0; i < ((int)(5)); ++i) {
    int add = -INF;
    for (int j = 0; j < ((int)((a[i] == -1 ? 1 : num_new + 1))); ++j) {
      int sca = (a[i] == -1 ? 0 : prob_score(a[i], succ[i] + j, n + num_new));
      int scb = (b[i] == -1 ? 0 : prob_score(b[i], succ[i] + j, n + num_new));
      add = max(add, sca - scb);
    }
    diff += add;
  }
  return diff > 0;
}
int main() {
  n = IO.readInt<int>();
  for (int i = 0; i < ((int)(5)); ++i) a[i] = IO.readInt<int>();
  for (int i = 0; i < ((int)(5)); ++i) b[i] = IO.readInt<int>();
  for (int i = 0; i < ((int)(5)); ++i) succ[i] = (a[i] != -1) + (b[i] != -1);
  for (int j = (int)(2); j < ((int)(n)); ++j) {
    for (int i = 0; i < ((int)(5)); ++i)
      if (IO.readInt<int>() != -1) succ[i]++;
  }
  for (int k = 0; k < ((int)(120 * 32 + 179)); ++k) {
    if (can(k)) {
      IO.writeInt(k);
      IO.writeEndl();
      return 0;
    }
  }
  IO.writeInt(-1);
  IO.writeEndl();
  return 0;
}
