import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.Scanner;

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
    public boolean hasNext() { skipUnprintable(); return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    
    int nextInt() {
    	return (int)nextLong();
    }
}

public class Main {
	
	void run() {
		FastScanner sc=new FastScanner();
		int n=sc.nextInt();
		int[] a=new int[n];
		int[] b=new int[n];
		for (int i=0;i<n;++i) {
			a[i]=sc.nextInt();
		}
		for (int i=0;i<n;++i) {
			b[i]=sc.nextInt();
		}
		int[] ord=new int[n];
		for (int i=0;i<n;++i) ord[i]=i;
		int point=-1,ans=0;
		do {
			int sum=0;
			for (int i=0;i<n;++i) {
				if (a[ord[i]]>b[i]) {
					sum+=a[ord[i]]-b[i];
				}
			}
			if (sum==point) {
				++ans;
			} else if (sum>point){
				point=sum;
				ans=1;
			}
		} while (nextPermutation(ord));
		System.out.println(ans);
	}
	
	boolean nextPermutation(int[] a) {
		int n=a.length;
		int t=a.length-1;
		while (t>0 && a[t-1]>a[t]) --t;
		if (t==0) return false;
		int p=t-1;
		while (t+1<n && a[p]<a[t+1]) ++t;
		a[p]^=a[t];a[t]^=a[p];a[p]^=a[t];
		int s=p+1;
		t=n-1;
		while (s<t) {
			a[s]^=a[t];
			a[t]^=a[s];
			a[s]^=a[t];
			++s;--t;
		}
		return true;
	}
	
	void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));}
	
    public static void main(String[] args) {
    	new Main().run();
    }
}