vector<int> count(100,0);

vector<int> result;

for(int i=0;i<arr.size();i++){

count[arr[i]]++;

// cout<<arr[i]<<" "<<count[arr[i]]<<endl;

}

for(int j=0;j<100;j++){

for(int k=0; k<count[j];k++){

result.push_back(j);

}

}

cout<<endl;

return result;

{

ofstream fout(getenv("OUTPUT_PATH"));

int n;

cin >> n;

cin.ignore(numeric_limits<streamsize>::max(), '\n');

string arr_temp_temp;

getline(cin, arr_temp_temp);

vector<string> arr_temp = split_string(arr_temp_temp);

vector<int> arr(n);

for (int i = 0; i < n; i++) {

int arr_item = stoi(arr_temp[i]);

arr[i] = arr_item;

}

vector<int> result = countingSort(arr);

for (int i = 0; i < result.size(); i++) {

fout << result[i];

if (i != result.size() - 1) {

fout << " ";

}

}

fout << "\n";

fout.close();

return 0;

string::iterator new_end = unique(input_string.begin(), input_string.end(), [] (const char &x, const char &y) {

return x == y and x == ' ';

});

input_string.erase(new_end, input_string.end());

while (input_string[input_string.length() - 1] == ' ') {

input_string.pop_back();

}

vector<string> splits;

char delimiter = ' ';

size_t i = 0;

size_t pos = input_string.find(delimiter);

while (pos != string::npos) {

splits.push_back(input_string.substr(i, pos - i));

i = pos + 1;

pos = input_string.find(delimiter, i);

}

splits.push_back(input_string.substr(i, min(pos, input_string.length()) - i + 1));

return splits;