#include <iostream> #include <algorithm> using namespace std; typedef long long LL; string s, t, ans[105]; int n; int main() { getline(cin, s); for (int i = 0; i < s.size(); i++) if (isalpha(s[i])) t += s[i]; else { ans[++n] = t; t = ""; } sort(ans + 1, ans + n + 1); for (int i = 1; i <= n; i++) cout << ans[i] << endl; return 0; }