Problem:
Set Symmetric Difference Find the symmetric difference of two sets $A = \{a_0, a_1, ..., a_{n-1}\}$ and $B = \{b_0, b_1, ..., b_{m-1}\}$. Input The input is given in the following format. $n$
$a_0 \; a_1 \; ... \; a_{n-1}$
$m$
$b_0 \; b_1 \; ... \; b_{m-1}$ Elements in $A$ and $B$ are given in ascending order. There are no duplicate elements in each set. Output Print elements in the symmetric difference in ascending order. Print an element in a line. Constraints  $1 \leq n, m \leq 200,000$  $0 \leq a_0 < a_1 < ... < a_{n-1} \leq 10^9$  $0 \leq b_0 < b_1 < ... < b_{m-1} \leq 10^9$  Sample Input 1 7
1 2 3 4 5 6 7
4
2 4 6 8 Sample Output 1 1
3
5
7
8

Solution (Python):
input()
a = set(list(map(int,input().split())))
input()
b = set(list(map(int,input().split())))

for i in sorted(a^b):
    print(i)

Solution (Python):
n = int(input())
a = set(list(map(int,input().split())))
m = int(input())
b = set(list(map(int,input().split())))
s = sorted((a|b)-(a&b))
for c in s:print (c)

Solution (Python):
n = int(input())
a = set(map(int, input().split()))
m = int(input())
b = set(map(int, input().split()))
for i in sorted(a ^ b):
    print(i)

Solution (Python):
n = int(input())
a = set(map(int,input().split()))
m = int(input())
b = set(map(int,input().split()))
c = a ^ b
if c:
    print(*sorted(c),sep="\n")

Solution (Python):
n = int(input())
a = set(map(int, input().split()))
m = int(input())
b = set(map(int, input().split()))
s_union = a | b
s_intersection = a & b
ans = s_union - s_intersection
if ans:
    print(*sorted(ans), sep="\n")

Solution (Python):
n = int(input())
A = set(list(map(int, input().split())))
m = int(input())
B = set(list(map(int, input().split())))

answer = A.symmetric_difference(B)
[print(i) for i in sorted(answer)]

Solution (Python):
a = input()
setA = set(map(int, input().split()))
b = input()
setB = set(map(int, input().split()))

for elem in sorted(setA.symmetric_difference(setB)):
    print(elem)

Solution (Python):
input()
a = set(map(int, input().split()))
input()
b = set(map(int, input().split()))
[print(s) for s in map(str, sorted(list(a^b)))]

Solution (Python):
def main():
    n = int(input())
    a = set([int(a) for a in input().split()])
    m = int(input())
    b = set([int(a) for a in input().split()])

    c = a.symmetric_difference(b)
    sorted_c = sorted(c)
    for i in sorted_c:
        print(i)
main()

Solution (Python):
n=input()
a=set(map(int, input().split()))
n=input()
b=set(map(int, input().split()))
c={print(x) for x in sorted(set(a^b))}

Solution (Python):
input()
A = set([int(x) for x in input().split() ])
input()
B = set([int(x) for x in input().split() ])

for i in sorted(A^B):
    print(i)

Solution (Python):
n = int(input())
a = set(map(int, input().split()))
m = int(input())
b = set(map(int, input().split()))

for n in sorted(a ^ b): print(n)

Solution (Python):
n = int(input())
a = set(map(int, input().split( )))
m = int(input())
b = set(map(int, input().split( )))
sym = a^b

ans = list(sym)
ans.sort()
for i in ans:
    print(i)

Solution (Python):
if __name__ == "__main__":
    n = int(input())
    a = set(map(lambda x: int(x), input().split()))
    m = int(input())
    b = set(map(lambda x: int(x), input().split()))

    for elem in sorted(a.union(b) - a.intersection(b)):
        print(elem)

Solution (Python):
N = int(input())
A = set(map(int, input().split()))
M = int(input())
B = set(map(int, input().split()))
C = A ^ B
if C:
    print(*sorted(C), sep='\n')

Solution (Python):

"""
Set Operation - Set Symmetric Difference
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP2_9_D&lang=jp

"""
_ = input()
A = set([int(a) for a in input().split()])
_ = input()
B = set([int(b) for b in input().split()])
C = sorted(d for d in (A ^ B))
if C:
    print(*C, sep='\n')

Solution (Python):
N = int(input())
A = set(map(int, input().split()))
M = int(input())
B = set(map(int, input().split()))
C = A ^ B
if C:
    print(*sorted(C), sep='\n')

Solution (Python):
if __name__ == '__main__':

	input()
	A = set(map(int,input().split()))
	input()
	B = set(map(int,input().split()))

	C = sorted(A^B)

	for i in C:
		print(i)

Solution (Python):
n = int(input())

A = set(map(int, input().split()))

m = int(input())

B = set(map(int, input().split()))


for c in sorted(list((A - B) | (B - A))):
    print(c)

Solution (Python):
input()
a = set(list(map(int,input().split())))
input()
b = set(list(map(int,input().split())))
ans = a^b
ans = sorted(list(ans))
for i in ans:
    print(i)

Solution (Python):
n = int(input())
A = set(map(int, input().split()))
m = int(input())
B = set(map(int, input().split()))
C = A^B
if C:
    print(*sorted(C), sep='\n')

Solution (Python):
n=int(input())
A=list(map(int,input().split()))

m=int(input())
B=list(map(int,input().split()))

C=list(set(A)^set(B))
C.sort()

if C!=[]:
    print('\n'.join(map(str,C)))

Solution (Python):
input()
A = set(int(x) for x in input().split())
input()
B = set(int(x) for x in input().split())

for i in sorted((A | B) - (A & B)):
    print(i)

Solution (Python):
input()
s1 = set(map(int, input().split()))
input()
s2 = set(map(int, input().split()))

s = sorted(list(s1.symmetric_difference(s2)))

if len(s) != 0:
    print('\n'.join(map(str, s)))

Solution (Python):
n = int(input())
alist = list(map(int, input().split()))
m = int(input())
blist = list(map(int, input().split()))

anslist = set(alist) ^ set(blist)
anslist = list(anslist)
anslist.sort()

for ans in anslist:
    print(ans)

Solution (Python):
N = int(input())
A = set(map(int, input().split()))
M = int(input())
B = set(map(int, input().split()))
C = A ^ B
if C:
    print(*sorted(C), sep='\n')

Solution (Python):




def symdiff(n, m, a, b):
    i, j = 0, 0
    while i < n and j < m:
        if a[i] < b[j]:
            yield a[i]
            i += 1
        elif a[i] > b[j]:
            yield b[j]
            j += 1
        else:
            i += 1
            j += 1

    while i < n:
        yield a[i]
        i += 1
    while j < m:
        yield b[j]
        j += 1


def run():
    n = int(input())
    a = [int(i) for i in input().split()]
    m = int(input())
    b = [int(j) for j in input().split()]

    for v in symdiff(n, m, a, b):
        print(v)


if __name__ == '__main__':
    run()

Solution (Python):
n = int(input())
a = set(list(map(int, input().split())))
m = int(input())
b = set(list(map(int, input().split())))
for i in sorted(a^b):
    print(i)