def solve():
n = int(input())
numbers = sorted(map(int, input().split()))
total = sum(numbers) // n
for i in range(n):
print(numbers[i], total - numbers[i])
solve()
#include <bits/stdc++.h>
#include <set>
#include <string>
using namespace std;
int main(){
int t;
cin>>t;
int arr[2*t];
for(int i=0;i<2*t;i++){cin>>arr[i];}
for(int i=1;i<2*t;i++){
int curr = arr[i];
int j = i-1;
while(arr[j]>curr && j>=0){arr[j+1]=arr[j];j--;}
arr[j+1]=curr;
}
for(int i=0;i<t;i++){
cout<<arr[i]<<" "<<arr[2*t-i-1]<<"\n";
}
}1237A - Balanced Rating Changes | 1616A - Integer Diversity |
1627B - Not Sitting | 1663C - Pōja Verdon |
1497A - Meximization | 1633B - Minority |
688B - Lovely Palindromes | 66B - Petya and Countryside |
1557B - Moamen and k-subarrays | 540A - Combination Lock |
1553C - Penalty | 1474E - What Is It |
1335B - Construct the String | 1004B - Sonya and Exhibition |
1397A - Juggling Letters | 985C - Liebig's Barrels |
115A - Party | 746B - Decoding |
1424G - Years | 1663A - Who Tested |
1073B - Vasya and Books | 195B - After Training |
455A - Boredom | 1099A - Snowball |
1651D - Nearest Excluded Points | 599A - Patrick and Shopping |
237A - Free Cash | 1615B - And It's Non-Zero |
1619E - MEX and Increments | 34B - Sale |