import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Arrays;
import java.util.Scanner;

public class _sol {

    public static void main(String[] args) {
        File inputFile = new File("shuffle.in");
        try {
            Scanner reader = new Scanner(inputFile);

            int n = reader.nextInt();
            int a[] = new int[n];

            for(int ind = 0; ind<n;ind++){
                a[ind] = reader.nextInt();
            }

           int[] sequence = generateBestSequence(a);
            FileWriter writer = new FileWriter("shuffle.out");

            for (int ind = 0; ind < sequence.length; ind++) {
                writer.write(a[ind] + " ");
            }
            writer.write(System.getProperty( "line.separator" ));
            writer.close();
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        } catch (IOException e) {
            e.printStackTrace();
        }

    }

    private static int[] generateBestSequence(int[] a) {
        int[] preva = Arrays.copyOf(a, a.length);
        while (!isAscending(a)) {
            for (int ind = 1; ind < a.length; ind++) {
                if (a[ind - 1] >= a[ind]) {
                    int c = a[ind];
                    a[ind] = a[ind - 1] + 1;
                    a[ind - 1] = c - 1;
                }
            }
            if (Arrays.equals(preva,a)) {
                break;
            } else {
                preva = Arrays.copyOf(a, a.length);
            }

        }
        return a;
    }

    private static boolean isAscending(int[] a) {
        for (int ind = 1; ind < a.length; ind++) {
            if (a[ind] <= a[ind - 1]) {
                return false;
            }
        }
        return true;
    }
}