#include <bits/stdc++.h>
using namespace std;
mt19937 rang(chrono::high_resolution_clock::now().time_since_epoch().count());
const long double PI = 3.141592653589793;
const long long INF = 9223372036854775807ll;
const long long mod = 1e9 + 7;
void solve() {
  int n;
  cin >> n;
  vector<long long> a(n);
  long long ans = 0;
  long long sa = 0;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    sa += a[i];
  }
  int m;
  cin >> m;
  int k = 0;
  vector<long long> b(m);
  long long sb = 0;
  for (int i = 0; i < m; ++i) {
    cin >> b[i];
    sb += b[i];
  }
  ans = abs(sa - sb);
  vector<int> pr(4);
  vector<long long> search;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      if (ans > abs(sa - sb + 2 * (b[j] - a[i]))) {
        k = 1;
        ans = abs(sa - sb + 2 * (b[j] - a[i]));
        pr[0] = i;
        pr[2] = j;
      }
    }
  }
  if (m != 1) {
    for (int i = 0; i < m; ++i) {
      for (int j = i + 1; j < m; ++j) {
        search.push_back({b[i] + b[j]});
      }
    }
    sort(search.begin(), search.end());
    search.resize(unique(search.begin(), search.end()) - search.begin());
    long long sum;
    for (int i = 0; i < n; ++i) {
      for (int j = i + 1; j < n; ++j) {
        long long f = (sa - sb) - 2 * (a[i] + a[j]);
        int x = lower_bound(search.begin(), search.end(), (-f) / 2) -
                search.begin();
        for (int g = max(0, x - 1); g < min((int)search.size(), x + 2); ++g) {
          if (ans > abs(f + 2 * search[g])) {
            ans = abs(f + 2 * search[g]);
            sum = search[g];
            k = 2;
            pr[0] = i;
            pr[1] = j;
          }
        }
      }
    }
    if (k == 2) {
      for (int i = 0; i < m; ++i) {
        for (int j = i + 1; j < m; ++j) {
          if (sum == b[i] + b[j]) {
            pr[2] = i;
            pr[3] = j;
          }
        }
      }
    }
  }
  cout << ans << '\n' << k << '\n';
  for (int i = 0; i < k; ++i) {
    cout << pr[i] + 1 << " " << pr[i + 2] + 1 << '\n';
  }
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  srand(chrono::high_resolution_clock::now().time_since_epoch().count());
  solve();
  return 0;
}
