#include <iostream>
using namespace std;

const int MAX_LENGTH = 100000;

int main() {
	int n, v[MAX_LENGTH + 1];
	cin >> n;
	int nuleCount = 0, firstPos = 1, lastPos = 0;
	for (int i = 1; i <= n; ++i) {
		cin >> v[i];
	}
	
	int flag = 1;
	for (int i = 1; i < n; ++i) {
		int counter = 0;
		if (v[i] * v[i + 1] == 0) {
			++nuleCount;
		} else if (v[i] * v[i + 1] != 0) {
			lastPos = i;
			firstPos = i - nuleCount;
		}
	}
	for (int i = firstPos; i <= lastPos; ++i) {
		cout << v[i] <<" ";
	}
	// cout << firstPos << " " << lastPos;
	return 0;
}