import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author bone
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
    }

    static class Task {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int[] a = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = in.nextInt();
            }
            int[] b = Arrays.copyOf(a, n);
            Arrays.sort(b);

            for (int i = 0; i < n; i++) {
                int j = n - 1;
                while (a[i] == b[j]) {
                    j--;
                    break;
                }
                out.println(b[j]);
            }
        }

    }
}
 import java.io.OutputStream; OutputStream java.io import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.util.Arrays; Arrays java.util import java.util.Scanner; Scanner java.util public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
    }

    static class Task {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int[] a = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = in.nextInt();
            }
            int[] b = Arrays.copyOf(a, n);
            Arrays.sort(b);

            for (int i = 0; i < n; i++) {
                int j = n - 1;
                while (a[i] == b[j]) {
                    j--;
                    break;
                }
                out.println(b[j]);
            }
        }

    }
} Main public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
    } main {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
    } InputStream inputStream = System.in; inputStream System.in System System.in OutputStream outputStream = System.out; outputStream System.out System System.out Scanner in = new Scanner(inputStream); in new Scanner(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) Task solver = new Task(); solver new Task() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class Task {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int[] a = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = in.nextInt();
            }
            int[] b = Arrays.copyOf(a, n);
            Arrays.sort(b);

            for (int i = 0; i < n; i++) {
                int j = n - 1;
                while (a[i] == b[j]) {
                    j--;
                    break;
                }
                out.println(b[j]);
            }
        }

    } Task public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int[] a = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = in.nextInt();
            }
            int[] b = Arrays.copyOf(a, n);
            Arrays.sort(b);

            for (int i = 0; i < n; i++) {
                int j = n - 1;
                while (a[i] == b[j]) {
                    j--;
                    break;
                }
                out.println(b[j]);
            }
        } solve {
            int n = in.nextInt();
            int[] a = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = in.nextInt();
            }
            int[] b = Arrays.copyOf(a, n);
            Arrays.sort(b);

            for (int i = 0; i < n; i++) {
                int j = n - 1;
                while (a[i] == b[j]) {
                    j--;
                    break;
                }
                out.println(b[j]);
            }
        } int n = in.nextInt(); n in.nextInt() in.nextInt in int[] a = new int[n]; a new int[n] n for (int i = 0; i < n; i++) {
                a[i] = in.nextInt();
            } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
                a[i] = in.nextInt();
            } {
                a[i] = in.nextInt();
            } a[i] = in.nextInt() a[i] a i in.nextInt() in.nextInt in int[] b = Arrays.copyOf(a, n); b Arrays.copyOf(a, n) Arrays.copyOf Arrays a n Arrays.sort(b) Arrays.sort Arrays b for (int i = 0; i < n; i++) {
                int j = n - 1;
                while (a[i] == b[j]) {
                    j--;
                    break;
                }
                out.println(b[j]);
            } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
                int j = n - 1;
                while (a[i] == b[j]) {
                    j--;
                    break;
                }
                out.println(b[j]);
            } {
                int j = n - 1;
                while (a[i] == b[j]) {
                    j--;
                    break;
                }
                out.println(b[j]);
            } int j = n - 1; j n - 1 n 1 while (a[i] == b[j]) {
                    j--;
                    break;
                } a[i] == b[j] a[i] a i b[j] b j {
                    j--;
                    break;
                } j-- j break; out.println(b[j]) out.println out b[j] b j int testNumber testNumber Scanner in in PrintWriter out out public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
    }

    static class Task {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int[] a = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = in.nextInt();
            }
            int[] b = Arrays.copyOf(a, n);
            Arrays.sort(b);

            for (int i = 0; i < n; i++) {
                int j = n - 1;
                while (a[i] == b[j]) {
                    j--;
                    break;
                }
                out.println(b[j]);
            }
        }

    }
} public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
    }

    static class Task {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int[] a = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = in.nextInt();
            }
            int[] b = Arrays.copyOf(a, n);
            Arrays.sort(b);

            for (int i = 0; i < n; i++) {
                int j = n - 1;
                while (a[i] == b[j]) {
                    j--;
                    break;
                }
                out.println(b[j]);
            }
        }

    }
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author bone
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
    }

    static class Task {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int[] a = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = in.nextInt();
            }
            int[] b = Arrays.copyOf(a, n);
            Arrays.sort(b);

            for (int i = 0; i < n; i++) {
                int j = n - 1;
                while (a[i] == b[j]) {
                    j--;
                    break;
                }
                out.println(b[j]);
            }
        }

    }
}

