Sort_no_register_1

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    string s;
    vector<string> v;
    while (cin >> s) {
        v.push_back(s);
    }
    sort(begin(v), end(v), [](string s1, string s2) {
        transform(s1.begin(), s1.end(), s1.begin(), ::toupper);
        transform(s2.begin(), s2.end(), s2.begin(), ::toupper);
        return (s1 < s2);
    });
    for (const string& ch : v) {
        cout << ch << ' ';
    }
    return 0;
}