import java.util.Scanner;
import java.util.Arrays;
import java.lang.Math;

public class ReverseMin2 {
    public static void main(String[] args) {
        int[] mins = new int[1];
        mins[0] = Integer.MAX_VALUE;
        Scanner in = new Scanner(System.in);
        while(in.hasNextLine()) {
            int pos = 0; // index of element
            int prev = Integer.MAX_VALUE;
            String cur = in.nextLine();
            //System.err.println(cur);
            Scanner in_str = new Scanner(cur);
            while(in_str.hasNextInt()) {
                int val = in_str.nextInt(); // now index = 0
                int upper = Integer.MAX_VALUE;;
                if(mins.length > pos) {
                    upper = mins[pos];
                } else {
                    mins = Arrays.copyOf(mins, mins.length * 2);
                    mins[mins.length - 1] = val;
                }
                mins[pos] = Math.min(upper, Math.min(val, prev));
                System.out.print(mins[pos] + " ");
                prev = mins[pos];
                pos++;
            }
            System.out.print("\n");
        }
    }
}