#include <bits/stdc++.h>
using namespace std;
int main() {
  int a[4], b[4], n, m;
  while (cin >> a[0]) {
    n = 0;
    m = 0;
    cin >> a[1] >> a[2] >> a[3];
    for (int i = 0; i < 4; i++) {
      cin >> b[i];
      if (a[i] == b[i]) n++;
    }
    sort(a, a + 4);
    for (int i = 0; i < 4; i++) {
      if (*lower_bound(a, a + 4, b[i]) == b[i]) m++;
    }
    cout << n << " " << (m - n) << endl;
  }
  return (0);
}
