#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;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKY29uc3QgaW50IE1BWF9MRU5HVEggPSAxMDAwMDA7CgppbnQgbWFpbigpIHsKCWludCBuLCB2W01BWF9MRU5HVEggKyAxXTsKCWNpbiA+PiBuOwoJaW50IG51bGVDb3VudCA9IDAsIGZpcnN0UG9zID0gMSwgbGFzdFBvcyA9IDA7Cglmb3IgKGludCBpID0gMTsgaSA8PSBuOyArK2kpIHsKCQljaW4gPj4gdltpXTsKCX0KCQoJaW50IGZsYWcgPSAxOwoJZm9yIChpbnQgaSA9IDE7IGkgPCBuOyArK2kpIHsKCQlpbnQgY291bnRlciA9IDA7CgkJaWYgKHZbaV0gKiB2W2kgKyAxXSA9PSAwKSB7CgkJCSsrbnVsZUNvdW50OwoJCX0gZWxzZSBpZiAodltpXSAqIHZbaSArIDFdICE9IDApIHsKCQkJbGFzdFBvcyA9IGk7CgkJCWZpcnN0UG9zID0gaSAtIG51bGVDb3VudDsKCQl9Cgl9Cglmb3IgKGludCBpID0gZmlyc3RQb3M7IGkgPD0gbGFzdFBvczsgKytpKSB7CgkJY291dCA8PCB2W2ldIDw8IiAiOwoJfQoJLy8gY291dCA8PCBmaXJzdFBvcyA8PCAiICIgPDwgbGFzdFBvczsKCXJldHVybiAwOwp9

OQoxIDIgMyA0IDAgMSAwIDUgNiA=

9
1 2 3 4 0 1 0 5 6