#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[]= {1, -2, 1, 0, 5};
int n=sizeof(arr)/sizeof(arr[0]);
int x=0;
bool flag=false;
unordered_set<int> mp;
for(int j=0;j<n;j++)
{
int diff=x-arr[j];
if(mp.find(diff)!=mp.end()){
flag=true;
cout<<"true";
break;
}
mp.insert(arr[j]);
}
if(flag==false)
cout<<"false";
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBhcnJbXT0gezEsIC0yLCAxLCAwLCA1fTsKCWludCBuPXNpemVvZihhcnIpL3NpemVvZihhcnJbMF0pOwoJaW50IHg9MDsKCWJvb2wgZmxhZz1mYWxzZTsKCXVub3JkZXJlZF9zZXQ8aW50PiBtcDsKCWZvcihpbnQgaj0wO2o8bjtqKyspCgl7CgkJaW50IGRpZmY9eC1hcnJbal07CgkJaWYobXAuZmluZChkaWZmKSE9bXAuZW5kKCkpewoJCQlmbGFnPXRydWU7CgkJCWNvdXQ8PCJ0cnVlIjsKCQkJYnJlYWs7CgkJfQoJCW1wLmluc2VydChhcnJbal0pOwoJfQoJaWYoZmxhZz09ZmFsc2UpCgkJY291dDw8ImZhbHNlIjsKCXJldHVybiAwOwp9Cg==