Two Sum Pair Existence

Given an array of integers and an integer target, determine whether there exist two distinct elements in the array such that their sum equals the target. Mathematically, for an array \(a_1, a_2, \ldots, a_n\) and a target \(T\), you need to decide if there exist indices \(i \neq j\) with a_i + a_j = T.

The solution should read input from standard input and print the answer (either "True" or "False") to standard output.

inputFormat

The first line of input contains an integer \(n\) (\(n \ge 2\)), the number of elements in the array. The second line contains \(n\) space-separated integers representing the array elements. The third line contains an integer \(T\) representing the target sum.

outputFormat

Print a single line containing "True" if there exists a pair of distinct elements that add up to \(T\), otherwise print "False".

4
2 7 11 15
9

True