Sort_no_register

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

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