#include <iostream>
using namespace std;
const int maxn = 1000 * 1000 + 10;
int a[maxn];
int main() {
     int n;
     cin >> n;
     for(int i=0;i<n;++i)
         cin >> a[i];
     
     int x = a[0];
     int occ = 1;
     for(int i=1;i<n;++i)
         if(x == a[i])
             occ++;
         else{
             occ--;
             if(occ < 0) {
                 occ = 1;
                 x = a[i];
             }
         }
  
     int T = 0;
     for(int i=0;i<n;++i)
         if(x == a[i])
             T++;
  
     if(T > n / 2)
        cout << "We find it!! The element is: " << x << endl;
     else
        cout << "There is no dominant element :(" << endl;
  
     return 0;
}