#include <bits/stdc++.h>
using namespace std;
char string_in_buffer[(int)260];
void fast_scan(int &first) { scanf("%d", &first); }
void fast_scan(long long &first) { scanf("%lld", &first); }
void fast_scan(unsigned long long &first) { scanf("%llu", &first); }
void fast_scan(double &first) { scanf("%lf", &first); }
void fast_scan(long double &first) { scanf("%Lf", &first); }
void fast_scan(char &first) {
  scanf("%c", &first);
  if (first == '\n') {
    fast_scan(first);
  }
}
void fast_scan(string &first) {
  scanf("%s", string_in_buffer);
  first = string(string_in_buffer);
}
template <class TFirst, class TSecond>
void fast_scan(pair<TFirst, TSecond> &p) {
  fast_scan(p.first);
  fast_scan(p.second);
}
template <class T>
void fast_scan(vector<T> &v) {
  for (auto &first : v) fast_scan(first);
}
void fast_print(const int &first) { printf("%d", first); }
void fast_print(const long long &first) { printf("%lld", first); }
void fast_print(const unsigned long long &first) { printf("%llu", first); }
void fast_print(const double &first) { printf("%.15lf", first); }
void fast_print(const long double &first) { printf("%.15Lf", first); }
void fast_print(const char &first) { printf("%c", first); };
void fast_print(const string &first) { printf("%s", first.c_str()); }
template <class TFirst, class TSecond>
void fast_print(const pair<TFirst, TSecond> &p) {
  fast_print(p.first);
  fast_print(' ');
  fast_print(p.second);
}
template <class T>
void fast_print(const vector<T> &v) {
  if (v.empty()) return;
  fast_print(v[0]);
  for (int i = 1; i < v.size(); i++) {
    fast_print(" ");
    fast_print(v[i]);
  }
}
template <class T>
void fast_print(const vector<vector<T>> &v) {
  if (v.empty()) return;
  fast_print(v[0]);
  for (int i = 1; i < v.size(); i++) {
    fast_print("\n");
    fast_print(v[i]);
  }
}
using namespace std;
namespace smart_io {
string print_start = "";
string sep = " ";
bool first_print = false;
void precall_print() {
  fast_print(print_start);
  print_start = "\n";
  first_print = true;
}
}  // namespace smart_io
template <class T>
ostream &operator,(ostream &os, const T &object) {
  if (!smart_io::first_print) {
    fast_print(smart_io::sep);
  } else {
    smart_io::first_print = false;
  }
  fast_print(object);
  return os;
}
template <class T>
istream &operator,(istream &is, T &object) {
  fast_scan(object);
  return is;
}
namespace typedefs {}
namespace numbers_operation {
template <class T>
T floor_mod(T a, T b) {
  if (a % b == 0) return 0;
  if (a >= 0 && b >= 0) return a % b;
  if (a <= 0 && b <= 0) return a % b;
  return abs(b) - (abs(a) % abs(b));
}
}  // namespace numbers_operation
using namespace numbers_operation;
using namespace typedefs;
long long n;
long long deltaq = 0;
vector<vector<long long>> v;
vector<long long> true_solve(5, 0);
long long points(long long solvers) {
  if (n + deltaq < solvers * 2) return 500;
  if (n + deltaq < solvers * 4) return 1000;
  if (n + deltaq < solvers * 8) return 1500;
  if (n + deltaq < solvers * 16) return 2000;
  if (n + deltaq < solvers * 32) return 2500;
  return 3000;
}
double task_scores(long long p, long long task, long long delta = 0) {
  if (v[p][task] == -1) return 0;
  return round(double(points(true_solve[task] + delta)) *
               double(1 - double(v[p][task]) / double(250)));
}
signed main(signed argc, char *argv[]) {
  cin, n;
  v.resize(n, vector<long long>(5));
  cin, v;
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < 5; j++) {
      if (v[i][j] != -1) {
        true_solve[j]++;
      }
    }
  }
  for (long long addelta = 0; addelta < 5000; addelta++) {
    deltaq = addelta;
    vector<map<long long, bool>> dp(5);
    long long _prev = -1;
    long long right = addelta + 1;
    if (v[0][0] == -1) {
      right = 1;
    }
    for (long long i = 0; i < right; i++) {
      if (points(true_solve[0] + i) != _prev) {
        long long first = task_scores(0, 0, i);
        long long second = task_scores(1, 0, i);
        dp[0][first - second] = 1;
        _prev = points(true_solve[0] + i);
      }
    }
    for (long long j = 1; j < 5; j++) {
      long long _prev = -1;
      long long right = addelta + 1;
      if (v[0][j] == -1) {
        right = 1;
      }
      for (long long i = 0; i < right; i++) {
        if (points(true_solve[j] + i) != _prev) {
          long long first = task_scores(0, j, i);
          long long second = task_scores(1, j, i);
          long long profit = first - second;
          for (auto p : dp[j - 1]) {
            if (addelta == 1 && j == 3) {
            }
            dp[j][p.first + profit] = 1;
          }
          _prev = points(true_solve[j] + i);
        }
      }
    }
    for (auto p : dp.back()) {
      if (p.first > 0) {
        smart_io::precall_print();
        cout, addelta;
        return 0;
      }
    }
  }
  smart_io::precall_print();
  cout, -1;
}
