#include <bits/stdc++.h>
#include <unordered_set>
#include <algorithm>
 
using namespace std;
 
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vs = vector<string>;
 
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repll(i,n) for (ll i = 0; i < (ll)(n); i++)
#define fore(x,a) for(auto&(x) : (a))
 
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 (b<a) { a=b; return 1; } return 0; }
 
#define ALL(a) (a).begin(), (a).end()
 
const ll INFL = 1e18;
const int INFI = 1e9;
const int MOD = 1e9 + 7;
 
int main(){
  double N;
  cin >> N;
  N *= 1.08;
  int n = N;
  if(n < 206) {
    cout << "Yay!" << endl;
  }
  else if(n == 206) {
    cout << "so-so" << endl;
  }
  else cout << ":(" << endl;
}
#include <bits/stdc++.h>

using namespace std;

#define ar array
#define ll long long

const int MAX_N = 1e5 + 1;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;



void solve() {
    int n; cin >> n;
    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++) cin >> a[i];
    vector<int> ans, used(n + 1);
    for (int i = 1; i < n; i++) {
        int pos = i;
        while (a[pos] != i) pos++;
        if (pos == i) {
            if (!used[pos]) {
                cout << -1 << "\n";
                return;
            }
            continue;
        }
        while (pos > i) {
            pos--;
            if (used[pos]) {
				cout << -1 << "\n";
                return;
			}
			used[pos] = 1;
			ans.push_back(pos);
			swap(a[pos], a[pos + 1]);
        }
    }
    if (ans.size() != n - 1) {
        cout << -1 << "\n";
        return;
    }
    for (int x : ans) cout << x << "\n";
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int tc = 1;
    // cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case #" << t  << ": ";
        solve();
    }
}