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;
    }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz