import java.util.*;

public class Main{
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        for(int i = 0; i < n; i++)
            a[i] = sc.nextInt();
        
        int max1 = max(a);
        int max2 = sec_max(a);
        for(int i = 0; i < n; i++){
            if(max1 == a[i])
                System.out.println(max2);
            else
                System.out.println(max1);
        }
        sc.close();  
    }

    static int max(int[] a){
        int max = a[0];
        for(int i = 1; i < a.length; i++){
            if(a[i] > max) 
                max = a[i];
        }
        return max;
    }

    static int sec_max(int[] a){
        int max1;
        int max2;
        if(a[0] > a[1]){
            max1 = a[0];
            max2 = a[1];
        }else {
            max1 = a[1];
            max2 = a[0];
        }
        if(a.length > 2){
            for(int i = 2; i < a.length; i++){
                if(a[i] > max1) {
                    max2 = max1;
                    max1 = a[i];
                } else if(a[i] > max2){
                    max2 = a[i];
                }
            }
        }
        return max2;
    }
} import java.util.*; util.* java public class Main{
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        for(int i = 0; i < n; i++)
            a[i] = sc.nextInt();
        
        int max1 = max(a);
        int max2 = sec_max(a);
        for(int i = 0; i < n; i++){
            if(max1 == a[i])
                System.out.println(max2);
            else
                System.out.println(max1);
        }
        sc.close();  
    }

    static int max(int[] a){
        int max = a[0];
        for(int i = 1; i < a.length; i++){
            if(a[i] > max) 
                max = a[i];
        }
        return max;
    }

    static int sec_max(int[] a){
        int max1;
        int max2;
        if(a[0] > a[1]){
            max1 = a[0];
            max2 = a[1];
        }else {
            max1 = a[1];
            max2 = a[0];
        }
        if(a.length > 2){
            for(int i = 2; i < a.length; i++){
                if(a[i] > max1) {
                    max2 = max1;
                    max1 = a[i];
                } else if(a[i] > max2){
                    max2 = a[i];
                }
            }
        }
        return max2;
    }
} Main public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        for(int i = 0; i < n; i++)
            a[i] = sc.nextInt();
        
        int max1 = max(a);
        int max2 = sec_max(a);
        for(int i = 0; i < n; i++){
            if(max1 == a[i])
                System.out.println(max2);
            else
                System.out.println(max1);
        }
        sc.close();  
    } main {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        for(int i = 0; i < n; i++)
            a[i] = sc.nextInt();
        
        int max1 = max(a);
        int max2 = sec_max(a);
        for(int i = 0; i < n; i++){
            if(max1 == a[i])
                System.out.println(max2);
            else
                System.out.println(max1);
        }
        sc.close();  
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int[] a = new int[n]; a new int[n] n for(int i = 0; i < n; i++)
            a[i] = sc.nextInt(); int i = 0; int i = 0; i 0 i < n i n i++ i++ i a[i] = sc.nextInt(); a[i] = sc.nextInt() a[i] a i sc.nextInt() sc.nextInt sc int max1 = max(a); max1 max(a) max a int max2 = sec_max(a); max2 sec_max(a) sec_max a for(int i = 0; i < n; i++){
            if(max1 == a[i])
                System.out.println(max2);
            else
                System.out.println(max1);
        } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
            if(max1 == a[i])
                System.out.println(max2);
            else
                System.out.println(max1);
        } {
            if(max1 == a[i])
                System.out.println(max2);
            else
                System.out.println(max1);
        } if(max1 == a[i])
                System.out.println(max2);
            else
                System.out.println(max1); max1 == a[i] max1 a[i] a i System.out.println(max2) System.out.println System.out System System.out max2 System.out.println(max1) System.out.println System.out System System.out max1 sc.close() sc.close sc String args[] args static int max(int[] a){
        int max = a[0];
        for(int i = 1; i < a.length; i++){
            if(a[i] > max) 
                max = a[i];
        }
        return max;
    } max {
        int max = a[0];
        for(int i = 1; i < a.length; i++){
            if(a[i] > max) 
                max = a[i];
        }
        return max;
    } int max = a[0]; max a[0] a 0 for(int i = 1; i < a.length; i++){
            if(a[i] > max) 
                max = a[i];
        } int i = 1; int i = 1; i 1 i < a.length i a.length a a.length i++ i++ i {
            if(a[i] > max) 
                max = a[i];
        } {
            if(a[i] > max) 
                max = a[i];
        } if(a[i] > max) 
                max = a[i]; a[i] > max a[i] a i max max = a[i] max a[i] a i return max; max int[] a a static int sec_max(int[] a){
        int max1;
        int max2;
        if(a[0] > a[1]){
            max1 = a[0];
            max2 = a[1];
        }else {
            max1 = a[1];
            max2 = a[0];
        }
        if(a.length > 2){
            for(int i = 2; i < a.length; i++){
                if(a[i] > max1) {
                    max2 = max1;
                    max1 = a[i];
                } else if(a[i] > max2){
                    max2 = a[i];
                }
            }
        }
        return max2;
    } sec_max {
        int max1;
        int max2;
        if(a[0] > a[1]){
            max1 = a[0];
            max2 = a[1];
        }else {
            max1 = a[1];
            max2 = a[0];
        }
        if(a.length > 2){
            for(int i = 2; i < a.length; i++){
                if(a[i] > max1) {
                    max2 = max1;
                    max1 = a[i];
                } else if(a[i] > max2){
                    max2 = a[i];
                }
            }
        }
        return max2;
    } int max1; max1 int max2; max2 if(a[0] > a[1]){
            max1 = a[0];
            max2 = a[1];
        }else {
            max1 = a[1];
            max2 = a[0];
        } a[0] > a[1] a[0] a 0 a[1] a 1 {
            max1 = a[0];
            max2 = a[1];
        } max1 = a[0] max1 a[0] a 0 max2 = a[1] max2 a[1] a 1 {
            max1 = a[1];
            max2 = a[0];
        } max1 = a[1] max1 a[1] a 1 max2 = a[0] max2 a[0] a 0 if(a.length > 2){
            for(int i = 2; i < a.length; i++){
                if(a[i] > max1) {
                    max2 = max1;
                    max1 = a[i];
                } else if(a[i] > max2){
                    max2 = a[i];
                }
            }
        } a.length > 2 a.length a a.length 2 {
            for(int i = 2; i < a.length; i++){
                if(a[i] > max1) {
                    max2 = max1;
                    max1 = a[i];
                } else if(a[i] > max2){
                    max2 = a[i];
                }
            }
        } for(int i = 2; i < a.length; i++){
                if(a[i] > max1) {
                    max2 = max1;
                    max1 = a[i];
                } else if(a[i] > max2){
                    max2 = a[i];
                }
            } int i = 2; int i = 2; i 2 i < a.length i a.length a a.length i++ i++ i {
                if(a[i] > max1) {
                    max2 = max1;
                    max1 = a[i];
                } else if(a[i] > max2){
                    max2 = a[i];
                }
            } {
                if(a[i] > max1) {
                    max2 = max1;
                    max1 = a[i];
                } else if(a[i] > max2){
                    max2 = a[i];
                }
            } if(a[i] > max1) {
                    max2 = max1;
                    max1 = a[i];
                } else if(a[i] > max2){
                    max2 = a[i];
                } a[i] > max1 a[i] a i max1 {
                    max2 = max1;
                    max1 = a[i];
                } max2 = max1 max2 max1 max1 = a[i] max1 a[i] a i if(a[i] > max2){
                    max2 = a[i];
                } a[i] > max2 a[i] a i max2 {
                    max2 = a[i];
                } max2 = a[i] max2 a[i] a i return max2; max2 int[] a a public class Main{
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        for(int i = 0; i < n; i++)
            a[i] = sc.nextInt();
        
        int max1 = max(a);
        int max2 = sec_max(a);
        for(int i = 0; i < n; i++){
            if(max1 == a[i])
                System.out.println(max2);
            else
                System.out.println(max1);
        }
        sc.close();  
    }

    static int max(int[] a){
        int max = a[0];
        for(int i = 1; i < a.length; i++){
            if(a[i] > max) 
                max = a[i];
        }
        return max;
    }

    static int sec_max(int[] a){
        int max1;
        int max2;
        if(a[0] > a[1]){
            max1 = a[0];
            max2 = a[1];
        }else {
            max1 = a[1];
            max2 = a[0];
        }
        if(a.length > 2){
            for(int i = 2; i < a.length; i++){
                if(a[i] > max1) {
                    max2 = max1;
                    max1 = a[i];
                } else if(a[i] > max2){
                    max2 = a[i];
                }
            }
        }
        return max2;
    }
} public class Main{
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        for(int i = 0; i < n; i++)
            a[i] = sc.nextInt();
        
        int max1 = max(a);
        int max2 = sec_max(a);
        for(int i = 0; i < n; i++){
            if(max1 == a[i])
                System.out.println(max2);
            else
                System.out.println(max1);
        }
        sc.close();  
    }

    static int max(int[] a){
        int max = a[0];
        for(int i = 1; i < a.length; i++){
            if(a[i] > max) 
                max = a[i];
        }
        return max;
    }

    static int sec_max(int[] a){
        int max1;
        int max2;
        if(a[0] > a[1]){
            max1 = a[0];
            max2 = a[1];
        }else {
            max1 = a[1];
            max2 = a[0];
        }
        if(a.length > 2){
            for(int i = 2; i < a.length; i++){
                if(a[i] > max1) {
                    max2 = max1;
                    max1 = a[i];
                } else if(a[i] > max2){
                    max2 = a[i];
                }
            }
        }
        return max2;
    }
} Main
import java.util.*;

public class Main{
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        for(int i = 0; i < n; i++)
            a[i] = sc.nextInt();
        
        int max1 = max(a);
        int max2 = sec_max(a);
        for(int i = 0; i < n; i++){
            if(max1 == a[i])
                System.out.println(max2);
            else
                System.out.println(max1);
        }
        sc.close();  
    }

    static int max(int[] a){
        int max = a[0];
        for(int i = 1; i < a.length; i++){
            if(a[i] > max) 
                max = a[i];
        }
        return max;
    }

    static int sec_max(int[] a){
        int max1;
        int max2;
        if(a[0] > a[1]){
            max1 = a[0];
            max2 = a[1];
        }else {
            max1 = a[1];
            max2 = a[0];
        }
        if(a.length > 2){
            for(int i = 2; i < a.length; i++){
                if(a[i] > max1) {
                    max2 = max1;
                    max1 = a[i];
                } else if(a[i] > max2){
                    max2 = a[i];
                }
            }
        }
        return max2;
    }
}