#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[2222], b[2222];
map<long long, pair<int, int> > sum;
long long sa, sb;
long long opt;
vector<pair<int, int> > ans;
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    sa += a[i];
  }
  scanf("%d", &m);
  for (int i = 0; i < m; i++) {
    scanf("%d", &b[i]);
    sb += b[i];
  }
  opt = abs(sa - sb);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      long long nsa = sa - a[i] + b[j];
      long long nsb = sb - b[j] + a[i];
      if (abs(nsa - nsb) < opt) {
        opt = abs(nsa - nsb);
        ans.clear();
        ans.push_back(make_pair((i + 1), (j + 1)));
      }
    }
  }
  if (sa < sb) {
    for (int i = 0; i < m; i++) {
      for (int j = i + 1; j < m; j++) {
        if (sum.find(2LL * (b[i] + b[j])) == sum.end())
          sum[2LL * (b[i] + b[j])] = make_pair((i + 1), (j + 1));
      }
    }
    for (int i = 0; i < n; i++) {
      for (int j = i + 1; j < n; j++) {
        long long target = sb - sa + 2LL * (a[i] + a[j]);
        map<long long, pair<int, int> >::iterator it = sum.lower_bound(target);
        if (abs(target - it->first) < opt) {
          opt = abs(target - it->first);
          ans.clear();
          ans.push_back(make_pair((i + 1), (it->second.first)));
          ans.push_back(make_pair((j + 1), (it->second.second)));
        }
        if (it != sum.begin()) it--;
        if (abs(target - it->first) < opt) {
          opt = abs(target - it->first);
          ans.clear();
          ans.push_back(make_pair((i + 1), (it->second.first)));
          ans.push_back(make_pair((j + 1), (it->second.second)));
        }
      }
    }
  } else {
    for (int i = 0; i < n; i++) {
      for (int j = i + 1; j < n; j++) {
        if (sum.find(2LL * (a[i] + a[j])) == sum.end())
          sum[2LL * (a[i] + a[j])] = make_pair((i + 1), (j + 1));
      }
    }
    for (int i = 0; i < m; i++) {
      for (int j = i + 1; j < m; j++) {
        long long target = sa - sb + 2LL * (b[i] + b[j]);
        map<long long, pair<int, int> >::iterator it = sum.lower_bound(target);
        if (abs(target - it->first) < opt) {
          opt = abs(target - it->first);
          ans.clear();
          ans.push_back(make_pair((it->second.first), (i + 1)));
          ans.push_back(make_pair((it->second.second), (j + 1)));
        }
        if (it != sum.begin()) it--;
        if (abs(target - it->first) < opt) {
          opt = abs(target - it->first);
          ans.clear();
          ans.push_back(make_pair((it->second.first), (i + 1)));
          ans.push_back(make_pair((it->second.second), (j + 1)));
        }
      }
    }
  }
  printf("%I64d\n", opt);
  printf("%d\n", ans.size());
  for (int i = 0; i < ans.size(); i++)
    printf("%d %d\n", ans[i].first, ans[i].second);
  return 0;
}
