#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18 + 1;
inline long long input(void) {
  char t;
  long long x = 0;
  int neg = 0;
  t = getchar();
  while ((t < 48 || t > 57) && t != '-') t = getchar();
  if (t == '-') {
    neg = 1;
    t = getchar();
  }
  while (t >= 48 && t <= 57) {
    x = (x << 3) + (x << 1) + t - 48;
    t = getchar();
  }
  if (neg) x = -x;
  return x;
}
inline void output(long long x) {
  char a[20];
  int i = 0, j;
  a[0] = '0';
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  if (x == 0) putchar('0');
  while (x) {
    a[i++] = x % 10 + 48;
    x /= 10;
  }
  for (j = i - 1; j >= 0; j--) {
    putchar(a[j]);
  }
  putchar('\n');
}
set<long long> s;
set<long long>::iterator ii;
long long a[1000010], b[1000010];
int main() {
  long long n, m, y, asum = 0, bsum = 0, val = 0, x;
  int aidx = -1, ajdx = -1, bidx = -1, bjdx = -1;
  n = input();
  for (int i = 0; i < n; ++i) {
    a[i] = input();
    val += 1ll * a[i];
    asum += 1ll * a[i];
  }
  m = input();
  for (int i = 0; i < m; ++i) {
    b[i] = input();
    val -= 1ll * b[i];
    bsum += 1ll * b[i];
  }
  val = abs(val);
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < m; ++j)
      if (abs(asum - 2ll * a[i] + 2ll * b[j] - bsum) < val) {
        val = abs(asum - 2ll * a[i] + 2ll * b[j] - bsum);
        aidx = i;
        bidx = j;
      }
  if (val > 0) {
    for (int i = 0; i < m; ++i)
      for (int j = i + 1; j < m; ++j) s.insert(2 * (b[i] + b[j]));
    for (int i = 0; i < n; ++i)
      for (int j = i + 1; j < n; ++j) {
        x = asum - 2ll * (a[i] + a[j]) - bsum;
        y = -x;
        ii = s.lower_bound(y);
        if (ii != s.end()) {
          y = *ii;
          if (abs(x + 1ll * y) < val) {
            aidx = i;
            ajdx = j;
            val = abs(x + 1ll * y);
          }
        }
        if (ii != s.begin()) {
          ii--;
          y = *ii;
          if (abs(x + 1ll * y) < val) {
            aidx = i;
            ajdx = j;
            val = abs(x + 1ll * y);
          }
          ii++;
        }
      }
  }
  if (aidx == -1) {
    output(val);
    output(0);
  } else if (ajdx == -1) {
    output(val);
    output(1);
    printf("%d %d\n", aidx + 1, bidx + 1);
  } else {
    output(val);
    output(2);
    for (int i = 0; i < m; ++i)
      for (int j = i + 1; j < m; ++j) {
        x = abs(asum - 2ll * (a[aidx] + a[ajdx]) + 2ll * (b[i] + b[j]) - bsum);
        if (x == val) {
          printf("%d %d\n", aidx + 1, i + 1);
          printf("%d %d\n", ajdx + 1, j + 1);
          return 0;
        }
      }
  }
  return 0;
}
