reverse sort

import java.util.Scanner;
public class reversesort
{
    public static String reverse(String words){
        char[] temparray = words.toCharArray();
        int left, right=0;
        right = temparray.length-1;

        for (left=0; left < right ; left++ ,right--)
        {
            // Swap values of left and right
            char temp = temparray[left];
            temparray[left] = temparray[right];
            temparray[right]=temp;
        }

        String res = new String(temparray);

        return res;
    }
    public static void main(String[] args)
    {
        int n;
        String temp;
        Scanner s = new Scanner(System.in);
        n = s.nextInt(); //read numver of string
        String names[] = new String[n];
        String rnames[] = new String[n];
        Scanner s1 = new Scanner(System.in);
       //read all the names and reverse it
        for(int i = 0; i < n; i++)
        {
            String inName = s1.nextLine();
            names[i] = inName;
            String rString = reverse(inName);
            rnames[i] = rString;
        }
        for (int i = 0; i < n; i++)
        {
            for (int j = i + 1; j < n; j++)
            {
                if (rnames[i].compareTo(rnames[j])>0)
                {
                    temp = names[i];
                    names[i] = names[j];
                    names[j] = temp;
                }
            }
        }
        System.out.println();
        for (int i = 0; i < n - 1; i++)
        {
            System.out.println(names[i]);
        }
        System.out.print(names[n - 1]);
    }
}