#include<bits/stdc++.h>
using namespace std;
const int N = 5050;
vector<int> ti_A(N , 0) , ti_B(N , 0) , ti_C(N , 0);
int lim_A = 0 , lim_B = 0 , lim_C = 0;
int cnt_A = 0 , cnt_B = 0 , cnt_C = 0;
int dp[91][91][91][2];
int n;
int ans;
vector<int>t(6);
void solve(int X , int Y , int Z , int lim_x , int lim_y , int lim_z) {
int my_score = (lim_x + lim_y + lim_z) * 100;
if (ti_A[1] != 0)
my_score += X * (250 - ti_A[1]) / 250;
if (ti_B[1] != 0)
my_score += Y * (250 - ti_B[1]) / 250;
if (ti_C[1] != 0)
my_score += Z * (250 - ti_C[1]) / 250;
memset(dp , 0 , sizeof(dp));
int cnt = 0;
int move = 0;
for (int i = 2 ; i <= n ; i ) {
if (ti_A[i] >= 0 && ti_B[i] >= 0 && ti_C[i] >= 0) {
move;
int score = 0;
if (ti_A[i] != 0) {
score += X * (250 - abs(ti_A[i])) / 250;
}
if (ti_B[i] != 0) {
score += Y * (250 - abs(ti_B[i])) / 250;
}
if (ti_C[i] != 0) {
score += Z * (250 - abs(ti_C[i])) / 250;
}
cnt += my_score >= score;
continue;
}
for (int x = 0 ; x < 2 ; x ++) {
if (x == 1 && ti_A[i] >= 0) continue;
for (int y = 0 ; y < 2 ; y ++) {
if (y == 1 && ti_B[i] >= 0) continue;
for (int z = 0 ; z < 2 ; z ++) {
if (z == 1 && ti_C[i] >= 0) continue;
for (int j = max(0 , x) ; j <= min(i - 1 , lim_x) ; j ++) {
for (int k = max(0 , y) ; k <= min(i - 1 , lim_y) ; k ++) {
for (int l = max(0 , z) ; l <= min(i - 1 , lim_z) ; l ++) {
int score = 0;
if (x == 0 && ti_A[i] != 0) {
score += X * (250 - abs(ti_A[i])) / 250;
}
if (y == 0 && ti_B[i] != 0) {
score += Y * (250 - abs(ti_B[i])) / 250;
}
if (z == 0 && ti_C[i] != 0) {
score += Z * (250 - abs(ti_C[i])) / 250;
}
dp[j][k][l][(i - move)%2] = max(dp[j][k][l][(i - move)%2] , dp[j - x][k - y][l - z][(i-move-1)%2] + (my_score >= score));
}
}
}
}
}
}
}
ans = min(ans , n -dp[lim_x][lim_y][lim_z][(n - move) % 2] - cnt);
}
void dfs(int x) {
if (x == 4) {
if (ans == 1) {
return;
}
int mx_A = (n >> t[1]) + 1;
if (t[1] == 0) {
if (lim_A == cnt_A)
mx_A = 0;
else
return;
}
int li_A = min(lim_A , (cnt_A - mx_A));
int mx_B = (n >> t[2]) + 1;
if (t[2] == 0) {
if (lim_B == cnt_B)
mx_B = 0;
else
return;
}
int li_B = min(lim_B , (cnt_B - mx_B));
int mx_C = (n >> t[3]) + 1;
if (t[3] == 0) {
if (lim_C == cnt_C)
mx_C = 0;
else
return;
}
int li_C = min(lim_C , (cnt_C - mx_C));
if (li_A < 0 || li_B < 0 || li_C < 0) {
return;
}
if ((n >= ((cnt_A - li_A) << t[1]) && (cnt_A - li_A != 0)) || (n >= ((cnt_B - li_B) << t[2]) && (cnt_B - li_B != 0)) || (n >= ((cnt_C - li_C) << t[3]) && (cnt_C - li_C != 0)) || (lim_A < 0 || lim_B < 0 || lim_C < 0)
|| 2 * n < ((cnt_A - li_A) << t[1]) || 2 * n < ((cnt_B - li_B) << t[2]) || 2 * n < ((cnt_C - li_C) << t[3])) {
return;
}
solve(t[1] * 500 , t[2] * 500 , t[3] * 500 , li_A , li_B , li_C);
return;
}
for (int j = 0 ; j <= 6 ; j ++) {
t[x] = j;
dfs(x + 1);
}
}
int main() {
ios::sync_with_stdio(false);
cin.sync_with_stdio(false);
cout.sync_with_stdio(false);
cin >> n;
for (int i = 1 ; i <= n ; i ++) {
cin >> ti_A[i] >> ti_B[i] >> ti_C[i];
cnt_A += (ti_A[i] != 0);
cnt_B += (ti_B[i] != 0);
cnt_C += (ti_C[i] != 0);
lim_A += (ti_A[i] < 0);
lim_B += (ti_B[i] < 0);
lim_C += (ti_C[i] < 0);
}
ans = n;
if (lim_A + lim_B + lim_C >= 90) {
ans = 1;
cout << ans;
return 0;
}
dfs(1);
cout << ans << endl;
}
