Let A and B be two sequences of n integers each, in the range [1, n^4]. Given an integer x, describe an O(n)-time algorithm for determining if there is an integer a in A and an integer b in B such that x = a + b.

Just to clarify. A and B contain n integers, and the values of the integers range from 1 to n^4.