Codeforces 779A-Pupils Redistribution

Pupils Redistribution

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

In Berland each high school student is characterized by academic performance — integer value between 1 and 5.

In high school 0xFF there are two groups of pupils: the group A and the group B. Each group consists of exactly n students. An academic performance of each student is known — integer value between 1 and 5.

The school director wants to redistribute students between groups so that each of the two groups has the same number of students whose academic performance is equal to 1, the same number of students whose academic performance is 2 and so on. In other words, the purpose of the school director is to change the composition of groups, so that for each value of academic performance the numbers of students in both groups are equal.

To achieve this, there is a plan to produce a series of exchanges of students between groups. During the single exchange the director selects one student from the class A and one student of class B. After that, they both change their groups.

Print the least number of exchanges, in order to achieve the desired equal numbers of students for each academic performance.

Input

The first line of the input contains integer number n (1 ≤ n ≤ 100) — number of students in both groups.

The second line contains sequence of integer numbers a1, a2, ..., an (1 ≤ ai ≤ 5), where ai is academic performance of the i-th student of the group A.

The third line contains sequence of integer numbers b1, b2, ..., bn (1 ≤ bi ≤ 5), where bi is academic performance of the i-th student of the group B.

Output

Print the required minimum number of exchanges or -1, if the desired distribution of students can not be obtained.

Examples

input

4
5 4 4 4
5 5 4 5

output

1

input

6
1 1 1 1 1 1
5 5 5 5 5 5

output

3

input

1
5
3

output

-1

input

9
3 2 5 5 2 3 3 3 2
4 1 4 1 1 2 4 4 1

output

4

题意：给出两组数，将两组中的数交换，使相同的数在两组内个数相同，求最小交换次数

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <climits>

using namespace std;

#define LL long long

int main()
{
    int n,a[105],b[105],c[10],d[10];
    while(~scanf("%d",&n))
    {
        memset(c,0,sizeof c);
        memset(d,0,sizeof d);
        for(int i=0;i<n;i++) scanf("%d",&a[i]),c[a[i]]++;
        for(int i=0;i<n;i++) scanf("%d",&b[i]),d[b[i]]++;
        int flag=1,sum=0;
        for(int i=1;i<=5;i++)
        {
            if((c[i]+d[i])%2) flag=0;
            if(c[i]>d[i]) sum+=(c[i]-d[i])/2;
        }
        if(!flag) printf("-1\n");
        else printf("%d\n",sum);
    }
    return 0;
}