#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;
}

I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBtYWluKCkgewogIAogIGludCBuLGs7CiAgY2luPj5uOwogIGludCAqYXJyID0gbmV3IGludFtuXTsKICAKICBmb3IoaW50IGk9MDtpPG47aSsrKQogIHsKICAgIGNpbj4+YXJyW2ldOwogIH0KICBjaW4+Pms7CiAgc29ydChhcnIsYXJyK24pOwogIGZvcihpbnQgaT0wO2k8bjtpKyspCiAgewogICAgdW5vcmRlcmVkX3NldDxpbnQ+IHN0OwogICAgaW50IHN1bSA9IGsgLSBhcnJbaV07CiAgICBmb3IoaW50IGo9aSsxO2o8bjtqKyspCiAgICB7CiAgICAgIGlmKHN0LmZpbmQoc3VtLWFycltqXSkhPXN0LmVuZCgpKQogICAgICB7CiAgICAgICAgY291dDw8YXJyW2ldPDwiLCI8PCIgIjw8c3VtLWFycltqXTw8IiAiPDwiYW5kIjw8IiAiPDxhcnJbal08PGVuZGw7CiAgICAgIH0KICAgICAgCiAgICAgIHN0Lmluc2VydChhcnJbal0pOwogICAgfQogIH0KICAKICAKCXJldHVybiAwOwp9

OQo1CjcKOQoxCjIKNAo2CjgKMwoxMA==

9
5
7
9
1
2
4
6
8
3
10