package main

import (
	"bufio"
	"fmt"
	"math"
	"os"
	"strconv"
)

const MaxInt = math.MaxInt64

var scanner *bufio.Scanner

func score(a, b []int) int {
	ret := 0
	for i := 0; i < len(a); i++ {
		if a[i] > b[i] {
			ret += a[i] - b[i]
		}
	}
	return ret
}

func main() {
	n := Int()
	a := Ints(n)
	b := Ints(n)
	max := score(a, b)
	count := 1
	//The Countdown QuickPerm Algo
	p := make([]int, n+1)
	for k := 0; k <= n; k++ {
		p[k] = k
	}
	i, j := 1, 0
	for i < n {
		p[i]--
		if i%2 == 1 {
			j = p[i]
		} else {
			j = 0
		}
		//swap
		a[i], a[j] = a[j], a[i]

		// process
		s := score(a, b)
		if s > max {
			max = s
			count = 1
		} else if s == max {
			count++
		}

		i = 1
		for p[i] == 0 {
			p[i] = i
			i++
		}
	}
	fmt.Println(count)
}

func init() {
	scanner = bufio.NewScanner(os.Stdin)
	scanner.Buffer([]byte{}, MaxInt)
	scanner.Split(bufio.ScanWords)
}

func Int() int {
	scanner.Scan()
	ret, _ := strconv.ParseInt(scanner.Text(), 10, 0)
	return int(ret)
}

func Ints(n int) []int {
	ret := make([]int, n)
	for i := 0; i < n; i++ {
		ret[i] = Int()
	}
	return ret
}

func Max(a, b int) int {
	if a < b {
		return b
	}
	return a
}

func Min(a, b int) int {
	if a < b {
		return a
	}
	return b
}