#include <bits/stdc++.h>
using namespace std;
 
bool twoSum(vector<int>& a , int target){
	unordered_set<int>st;
	for(int i=0;i<a.size();i++){
		int comp = target-a[i];
		if(st.find(comp)!=st.end()){
			return true;
		}
		st.insert(a[i]);
	}
	return false;
}
 
int main() {
    int n;
    cin >> n;
    vector<int> arr(n);
 
    for (int i = 0; i < n; i++) {
        cin >> arr[i];
    }
 
    int target;
    cin >> target;
 
    cout << (twoSum(arr, target) ? "True" : "False");
    return 0;
}
 

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgpib29sIHR3b1N1bSh2ZWN0b3I8aW50PiYgYSAsIGludCB0YXJnZXQpewoJdW5vcmRlcmVkX3NldDxpbnQ+c3Q7Cglmb3IoaW50IGk9MDtpPGEuc2l6ZSgpO2krKyl7CgkJaW50IGNvbXAgPSB0YXJnZXQtYVtpXTsKCQlpZihzdC5maW5kKGNvbXApIT1zdC5lbmQoKSl7CgkJCXJldHVybiB0cnVlOwoJCX0KCQlzdC5pbnNlcnQoYVtpXSk7Cgl9CglyZXR1cm4gZmFsc2U7Cn0KCmludCBtYWluKCkgewogICAgaW50IG47CiAgICBjaW4gPj4gbjsKICAgIHZlY3RvcjxpbnQ+IGFycihuKTsKICAgIAogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICBjaW4gPj4gYXJyW2ldOwogICAgfQogICAgCiAgICBpbnQgdGFyZ2V0OwogICAgY2luID4+IHRhcmdldDsKICAgIAogICAgY291dCA8PCAodHdvU3VtKGFyciwgdGFyZ2V0KSA/ICJUcnVlIiA6ICJGYWxzZSIpOwogICAgcmV0dXJuIDA7Cn0K

NQoxIC0yIC0xIDEgMwotMg==

5
1 -2 -1 1 3
-2