#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;
int counter = 0;
for (int i = 1; i < n; ++i) {
if (v[i] * v[i + 1] != 0 && flag == 1) {
//cout << i <<" "<< counter<<" ";
if (counter >= nuleCount) {
nuleCount = counter; // 2
lastPos = i; // 7
firstPos = i - counter ; // 1
// cout << firstPos << " " << lastPos <<" " << counter<<"|| \n";
counter = 0;
///flag = 1;
}
flag = 0;
} else if (v[i] * v[i + 1] == 0) {
++counter;
//cout << v[i] << " " << v[i + 1] << " "<< counter << "\n";
//
flag = 1;
if (i == n - 1 && v[i] * v[i + 1] == 0 && counter > nuleCount) {
//cout << v[i] << " " << v[i + 1] << " "<< counter << "\n";
nuleCount = counter;
lastPos = i + 1;
firstPos = i - counter + 1;
counter = 0;
}
}
}
// cout << firstPos << " " << lastPos <<" " << counter<<" \n";
if (firstPos == 1 && lastPos == 0) {
cout << "NU EXISTA" ;
} else {
for (int i = firstPos; i <= lastPos; ++i) {
cout << v[i] <<".";
}
}
//cout << firstPos << " " << lastPos;
return 0;
}
/*
1 2 3 4 0 1 0 5 6
15
1 0 1 0 2 1 2 2 2 1 0 1 0 1 0
9
1 2 3 4 5 0 7 8 9
9
0 -2 3 4 5 6 7 8 0
4
1 0 2 2
5
-5 -66 0 -7 -5
31
0 0 0 1 2 3 5 4 0 0 0 0 0 0 5 1 4 5 0 0 0 0 0 0 0 0 0 2 5 5 4
13
-2 0 2 0 2 2 5 4 1 0 1 0 1
*/