#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  if (a == 0 || a == b) {
    return b;
  }
  return gcd(b % a, a);
}
int main() {
  long long int n;
  cin >> n;
  vector<long long int> a(n), b(n);
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (long long int i = 0; i < n; i++) {
    cin >> b[i];
  }
  map<pair<long long int, long long int>, long long int> m;
  long long int res = 0;
  for (long long int i = 0; i < n; i++) {
    if (a[i] == 0 && b[i] == 0) {
      res++;
      continue;
    }
    if (a[i] == 0 && b[i] != 0) {
      continue;
    }
    long long int sign = 1;
    if (a[i] < 0) {
      sign *= -1;
      a[i] *= -1;
    }
    if (b[i] < 0) {
      sign *= -1;
      b[i] *= -1;
    }
    long long int x = gcd(min(a[i], b[i]), max(a[i], b[i]));
    while (x > 1) {
      a[i] = a[i] / x;
      b[i] = b[i] / x;
      x = gcd(min(a[i], b[i]), max(a[i], b[i]));
    }
    m[make_pair(sign * b[i], a[i])]++;
  }
  long long int mx = 0;
  for (auto it = m.begin(); it != m.end(); it++) {
    mx = max(mx, it->second);
  }
  res += mx;
  cout << res << endl;
}
