#include <iostream>

using namespace std;

void insertionSort(string array[], int length);
void tvofalda (string *&p, int &n);
int main()
{
    int n = 2;
    string *p;
    string s;
    p = new string[n];

    int i = 0;

    cin >> s;

    while(s != "quit")
    {
        p[i] = s;
        i++;
        cin >> s;

        if(i == n)
        {
            tvofalda(p,n);
        }
    }

    insertionSort(p,n);

    for (int i = 0; i < n; i++)
    {
        cout << p[i] << endl;
    }

    delete [] p;

    return 0;
}
void insertionSort(string array[], int length) {
  int i, j;
  string tmp;

  for (i = 1; i < length; i++) {
    tmp = array[i];
    j = i;
    while (j > 0 && array[j - 1] < tmp) {
      array[j] = array[j-1];
      j--;
    }
    array[j] = tmp;
  }
}

void tvofalda (string *&p, int &n)
{

    string *q;
    q = new string[n*2];

    for (int i = 0; i < n; i++)
    {
        q[i] = p[i];
    }

    delete [] p;

    p = q;
    n = n*2;
}