//#include<stdio.h>
//#include<math.h>
//int main()
//{
// int n,i,j;
// double a, b,max = 0.0;
// scanf("%d",&n);
// for(i=0;i<n;i++)
// {
// scanf("%lf %lf",&a,&b);
// if(b * log(a)>max)
// {
// max = b*log(a);
// j = i;
// }
// }
// printf("%d", j+1);
//}
//#include <stdio.h>
//int main()
//{
// int n, m, a, b, i;
// int arr[101]= {}, cnt = 0;
// scanf("%d %d", &n, &m);
// for(i = 0; i < m; i++)
// {
// scanf("%d %d", &a, &b);
// arr[a]++;
// arr[b]++;
// }
// for(i = 1; i <= n; i++)
// {
// if (arr[i] == 0)
// {
// puts("NO");
// return 0;
// }
// else if (arr[i] % 2 == 1)
// {
// cnt++;
// }
// }
// if (cnt == 0 || cnt == 2)
// {
// puts("YES");
// }
// else
// {
// puts("NO");
// }
// return 0;
//}
//#include<stdio.h>
//#define max(x,y) (x) > (y) ? (x): (y)
//int main()
//{
// int i,n, arr[100005] = {}, sum[100005] = {}, ans = 0;
// scanf("%d",&n);
// for(i=1;i<=n;i++)
// {
// scanf("%d", &arr[i]);
// sum[i] = sum[i-1] + arr[i];
// }
// for(i=2;i<n;i++)
// {
// ans = max(ans, sum[n-1]-arr[1]+arr[i]);
// ans = max(ans, (sum[n] - arr[1] - arr[i]) + (sum[n] - sum[i]));
// ans = max(ans, (sum[n-1]- arr[i])+sum[i-1]);
// }
// printf("%d",ans);
//}
#include<stdio.h>
int main()
{
int n, arr[100000001] = {}, m, brr[100001] = {},i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&arr[i]);
}
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d",&brr[i]);
}
}
# n = int(input())
# a = 0
# m = 1
# n -= 1
# while n > 0:
# m += 1
# n -= m
# if n % m == 0:
# a += 1
# print(a)
# n = int(input())
# print(n*(n-1)*(n-2)*(n-3))
# from math import log
# n = int(input())
# max = 0
# loc = 0
# v = 0
# for i in range(n):
# a, b = map(int, input().split())
# v += 1
# if max < b*log(a):
# max = log(a**b)
# loc = v
# print(loc)
# import operator
# a, b = map(int, input().split())
# print(operator.add(a, b))
# n = int(input())
# data = list(map(int, input().split()))
# v = []
# none = 0
# one = 0
# two = 0
# k = 0
# for i in range(n):
# v.append(1)
# for i in range(n):
# if data[i] == n:
# k = 1
# if v[data[i] - 2] == 0:
# none += 1
# elif v[data[i] - 2] == 1:
# one += 1
# v[data[i] - 1] = 0
# if data[i] == 1:
# k = 1
# if v[1] == 0:
# none += 1
# elif v[1] == 1:
# one += 1
# v[0] = 0
# if k == 0:
# if v[data[i]-2] == 0 and v[data[i]] == 0:
# none += 1
# elif (v[data[i]-2] == 0 and v[data[i]] == 1) or (v[data[i]-2] == 1 and v[data[i]] == 0):
# one += 1
# else:
# two += 1
# v[data[i] - 1] = 0
# k = 0
# print(one, two)
# n = int(input())
# data = []
# for i in range(n):
# data.append(i+1)
# for j in range(n):
# for i in range(1, len(data)+1):
# if len(data) == 1:
# break
# if i % 2 == 1:
# data[i-1] = -1
# data[:] = (value for value in data if value != -1)
# print(data[0])
# n = int(input())
# data = list(map(int, input().split()))
# sum = []
# for i in range(1, n):
# sum
# a = list(map(int, input().split()))
# b = list(map(int, input().split()))
# A = 0
# B = 0
# k = 0
# for i in range(10):
# if a[i] > b[i]:
# A += 3
# elif a[i] < b[i]:
# B += 3
# else:
# A += 1
# B += 1
# print(A, B)
# if A > B:
# print("A")
# elif A < B:
# print("B")
# elif A == B:
# for i in range(9, 0, -1):
# if k == 0:
# if a[i] > b[i]:
# print("A")
# k = 1
# elif a[i] < b[i]:
# print("B")
# k = 1
# if k == 0:
# print("D")
# n, m = map(int, input().split())
# data = list(map(int, input().split()))
# sum = []
# for i in range(n):
# sum.append(0)
# for i in range(n):
# sum[i] = sum[i-1] + data[i]
# for i in range(m):
# a, b = map(int, input().split())
# if a == 1:
# print(sum[b-a])
# else:
# print(sum[b-1]-sum[a-2])