#include <stdio.h>
#include <stdlib.h>
struct mon {
  struct mon* next;
  int level;
};
int cmp(const void* a, const void* b)
{
  return (*(int*)a - *(int*)b);
}
int Base = 11;
struct mon *List = 0;
struct mon *ListPool = 0;
struct mon *ListEnd = 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);
    ListEnd = ListPool+N;
  }
  List = ListPool;
  struct mon *l;
  for (l=List; l<ListEnd; l++, A++) {
    l->next = l+1;
    l->level = *A;
  }
  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 {
      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;
  int cnt;
  int mask = (1 << Base)-1;
  struct mon *l;
  for (l=ListPool; l<ListEnd; l++) {
    cnt = l->level & mask;
    if (max < cnt) {
      max = cnt;
    }
  }
  return max;
}
int main()
{
  int N;
  scanf("%d", &N);
  int *A = (int*)malloc(sizeof(int)*N*2);
  int *B = A+N;
  int *Ap;
  int *Aend = A+N;
  int *Bp;
  int *Bend = B+N;
  for (Ap=A; Ap<Aend; Ap++) scanf("%d", Ap);
  for (Bp=B; Bp<Bend; Bp++) scanf("%d", Bp);

  for (Ap=A; Ap<Aend; Ap++) (*Ap) <<= Base;
  for (Bp=B; Bp<Bend; Bp++) {
    (*Bp) >>= 1;
    (*Bp) <<= Base;
  }

  int i;
  int min = N+1;
  struct mon *a;
  list_init(N, A);
  for (i=0; i<N; i++) {
    int *Bstart = B+i;
    for (Bp=Bstart; Bp<Bend; Bp++) {
      a = list_out();
      a->level += ((*Bp)+1);
      list_in(a);
    }
    for (Bp=B; Bp<Bstart; Bp++) {
      a = list_out();
      a->level += ((*Bp)+1);
      list_in(a);
    }
    int cnt = max_count();
    if (cnt < min) {
      min = cnt;
    }
    list_init(N, A);
  }

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