#include <bits/stdc++.h>
#include <math.h>
#define REP(i,a,b) for (int i=a; i<b; i++)
#define ALL(v) (v).begin(), (v).end()
#define FORE(i,a) for(auto &i:a)
using namespace std;
typedef long long ll;
const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (a>b) { a=b; return 1; } return 0; }
//#pragma GCC optimize ("-O3")
void _main(); int main() {cin.tie(0); ios::sync_with_stdio(false); _main(); }

void _main() {
  ll N;
  cin >> N;
  vector<ll> A(N);
  REP(i,0,N) cin >> A[i];

  ll ans = 0;
  ll every_sum = 0;
  ll sq_sum = 0;
  REP(i,0,N) {
    every_sum += A[i]*A[i];
    sq_sum += A[i];
  }

  ans = N*every_sum - sq_sum*sq_sum;

  cout << ans << endl;
}

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
  ll N;
  cin >> N;
  vector<string> vec(N);
  rep(i, N) {
    cin >> vec.at(i);
    if(vec.at(i).at(0) != '!') {
      vec.at(i) = "!" + vec.at(i) + "&";
    }
  }
  ll co = -1;
  sort(vec.begin(), vec.end());
  rep(i, N - 1) {
    if(vec.at(i) != vec.at(i+1) && vec.at(i) + "&" == vec.at(i+1)) {
      co = i;
      break;
    }
  }
  if(co == -1) {
    cout << "satisfiable";
  }
  else {
    cout << vec.at(co).substr(1);
  }
}