#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

struct Pair {
    int distance;
    string s1;
    string s2;
};

bool cmp(const Pair &a, const Pair &b) {
    if (a.distance != b.distance) return a.distance < b.distance;//首先对组合的距离排序
    if (a.s1 != b.s1) return a.s1 < b.s1;//若距离相同，先看小的字符串之间的大小
    return a.s2 < b.s2;//若小的字符串相同，比较各组大的字符串进行排序
}

int calculateDistance(const string &s1, const string &s2) {
    int distance = 0;
    for (int i = 0; i < s1.length(); i++) {
        if (s1[i] != s2[i]) distance++;
    }
    return distance;
}

int main() {
    int n;
    cin >> n;
    vector<string> str(n);
    for (int i = 0; i < n; i++) {
        cin >> str[i]...