#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main() {
  
  int n,k;
  cin>>n;
  int *arr = new int[n];
  
  for(int i=0;i<n;i++)
  {
    cin>>arr[i];
  }
  cin>>k;
  sort(arr,arr+n);
  for(int i=0;i<n;i++)
  {
    unordered_set<int> st;
    int sum = k - arr[i];
    for(int j=i+1;j<n;j++)
    {
      if(st.find(sum-arr[j])!=st.end())
      {
        cout<<arr[i]<<","<<" "<<sum-arr[j]<<" "<<"and"<<" "<<arr[j]<<endl;
      }
      
      st.insert(arr[j]);
    }
  }
  
  
	return 0;
}