// includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>

// macros
#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a); i<(b);++i)
#define rep(i, n) FOR(i, 0, n)

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;

// solve

int main(int argc, char const* argv[])
{
  int a[4], b[4];
  while(cin >> a[0]){
    rep(i, 3)cin >> a[i+1];
    rep(i, 4)cin >> b[i];
    int hit = 0;
    int blow = 0;
    rep(i, 4){
      if(a[i] == b[i])hit++;
      rep(j, 4){
        if(a[i] == b[j]){
          blow++;
          break;
        }
      }
    }
    cout << hit << " " << blow - hit << endl;
  }
	return 0;
}

