#include <bits/stdc++.h> using namespace std; int main() { long long b1=0,b2=0,m1=0,m2=0,min=9999999,a[100000]={0},b[100000][2]={0},c=0,n,m; cin>>n; for (int i=0;i<n;i++) cin>>a[i]; cin>>m; //sort (a,a+m); for (int i=0;i<n;i++) for (int j=0;j<n;j++) if (a[i]+a[j]==m)//&&a[i]!=a[j] { b[c][0]=a[i]; b[c][1]=a[j]; if (a[i]>a[j]) swap(b[c][0],b[c][1]); c++; } if (b[0][0]==0) { cout<<"No"<<endl; return 0; } for (int i=0;i<c;i++) if (min>b[i][0]) { m1=b[i][0]; m2=b[i][1]; min=m1; } cout<<m1<<' '<<m2<<endl; }