#include <stdio.h>
#include <stdlib.h>
struct mon {
  struct mon* next;
  int level;
  int count;
};
int cmp(const void* a, const void* b)
{
  return (*(int*)a - *(int*)b);
}
struct mon *List = 0;
struct mon *ListPool = 0;
void list_init(int N, int *A)
{
  if (ListPool == 0) {
    qsort(A, N, sizeof(int), cmp);
    ListPool = (struct mon*)malloc(sizeof(struct mon)*N);
  }
  List = ListPool;
  int i;
  for (i=0; i<N; i++) {
    List[i].next = &(List[i+1]);
    List[i].level = A[i];
    List[i].count = 0;
  }
  List[N-1].next = 0;
  return;
}
struct mon *list_out(void)
{
  struct mon *a = List;
  List = a->next;
  a->next = 0;
  return a;
}
void list_in(struct mon *a)
{
  struct mon *l1 = 0;
  struct mon *l = List;
  while (l!=0) {
    if (a->level < l->level) {
      break;
    } else if (a->level == l->level) {
      if (a->count <= l->count) {
        break;
      } else {
        l1 = l;
      }
    } else {
      l1 = l;
    }
    l = l->next;
  }
  if (l1 == 0) {
    a->next = List;
    List = a;
  } else {
    a->next = l1->next;
    l1->next = a;
  }
  return;
}
int max_count()
{
  int max = 0;
  struct mon *l;
  for (l=List; l!=0; l=l->next) {
    if (max < l->count) {
      max = l->count;
    }
  }
  return max;
}
int main()
{
  int N;
  scanf("%d", &N);
  int *A = (int*)malloc(sizeof(int)*N);
  int *B = (int*)malloc(sizeof(int)*N);
  int i;
  for (i=0; i<N; i++) scanf("%d", &(A[i]));
  for (i=0; i<N; i++) scanf("%d", &(B[i]));

  int j;
  int min = N+1;
  struct mon *a;
  list_init(N, A);
  for (i=0; i<N; i++) {
    for (j=0; j<N; j++) {
      a = list_out();
      a->level += B[(i+j)%N]/2;
      a->count++;
      list_in(a);
    }
    int cnt = max_count();
    if (cnt < min) {
      min = cnt;
    }
    list_init(N, A);
  }

  printf("%d\n", min);
  return 0;
}