#include<bits/stdc++.h>
#include
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ll long long
#define pii pair<int,int>
#define vi vector
#define mii map<int,int>
#define pqb priority_queue
#define pqs priority_queue<int,vi,greater
#define setbit(x) __builtin_popcountll(x)
#define zrobit(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define w(x) int x; cin>>x; while(x–)
#define fo(i,a,b) for (int i = a; i <= b; i++)
#define foa(i,a,b) for (int i = a; i < b; i++)
void io()
{
#ifndef ONLINE_JUDGE
freopen(“input.txt”, “r”, stdin);
freopen(“output.txt”, “w”, stdout);
#endif
}
int main()
{
io();
int n;
cin>>n;
//int a[n];
mk(a,n,int);
foa(k,0,n)
{
cin>>a[k];
}
int target;
cin>>target;
sort(a,a+n);
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++)
if (a[i] + a[j] == target)
{
cout<<a[i]<<" and "<<a[j]<<endl;
}
return 0;
}