//
// main.cpp
// test
//
// Created by Jacky Roth on 2019/2/22.
// Copyright © 2019 Jacky Roth. All rights reserved.
//
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <math.h>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
const int maxn=1010;
double p1[maxn];
double p2[maxn];
double res[maxn*2];
vector<int>k1,k2;
struct node {
int n;
double x;
node(int _n,double _x):n(_n),x(_x){};
};
vector<node>ans;
int main(int argc, const char * argv[]) {
int N,M,n;
double val;
scanf("%d",&N);
for (int i=0; i<N; i++) {
scanf("%d%lf",&n,&val);
p1[n]=val;
k1.push_back(n);
}
scanf("%d",&M);
for (int i=0; i<M; i++) {
scanf("%d%lf",&n,&val);
p2[n]=val;
k2.push_back(n);
}
for (int i=0; i<k1.size(); i++) {
for (int j=0; j<k2.size(); j++) {
res[k1[i]+k2[j]]+=p1[k1[i]]*p2[k2[j]];
}
}
for (int i=0; i<2020; i++) {
if (res[i]!=0) {
ans.push_back(node(i, res[i]));
}
}
printf("%lu",ans.size());
for (int i=(int)ans.size()-1; i>=0; i--) {
printf(" %d %.1f",ans[i].n,ans[i].x);
}
return 0;
}