Construct an N-gon that satisfies the following conditions:

* The polygon is simple (see notes for the definition).
* Each edge of the polygon is parallel to one of the coordinate axes.
* Each coordinate is an integer between 0 and 10^9, inclusive.
* The vertices are numbered 1 through N in counter-clockwise order.
* The internal angle at the i-th vertex is exactly a_i degrees.



In case there are multiple possible answers, you can output any.

Constraints

* 3 ≤ N ≤ 1000
* a_i is either 90 or 270.

Input

The input is given from Standard Input in the following format:


N
a_1
:
a_N


Output

In case the answer exists, print the answer in the following format:


x_1 y_1
:
x_N y_N


Here (x_i, y_i) are the coordinates of the i-th vertex.

In case the answer doesn't exist, print a single `-1`.

Examples

Input

8
90
90
270
90
90
90
270
90


Output

0 0
2 0
2 1
3 1
3 2
1 2
1 1
0 1


Input

3
90
90
90


Output

-1
// #include {{{
#include <iostream>
#include <cassert>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <bitset>
#include <vector>
#include <complex>
#include <algorithm>
using namespace std;
// }}}
// #define {{{
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define de(x) cout << #x << "=" << x << endl
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define per(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
// }}}

const int N = 1010;
int n , a[N];

vector<pii> solve(vi&degs) {
  int n = sz(degs);
  vector<pii> res(n);
  if(n == 4) {
    res[0] = mp(0 , 0);
    res[1] = mp(1 , 0);
    res[2] = mp(1 , 1);
    res[3] = mp(0 , 1);
  } else {
    int s = 0;
    rep(i,0,n) if(degs[i] == 90 && degs[(i+1)%n] == 270) {
      s = (i + n - 1) % n;
      break;
    }
    vi ndegs(n - 2);
    int tot = 0;
    ndegs[tot++] = degs[s];
    rep(i,3,n) ndegs[tot++] = degs[(s+i)%n];
    vector<pii> pts = solve(ndegs);
    while(!(pts[0].fi < pts[1].fi && pts[0].se == pts[1].se))
      for(auto&p : pts) p = mp(p.se , -p.fi);
    for(auto&p : pts) p = mp(p.fi * 2 , p.se * 2);
    pts[1].se++;
    pts.insert(pts.begin() + 1 , mp(pts[0].fi + 1 , pts[0].se + 1));
    pts.insert(pts.begin() + 1 , mp(pts[0].fi + 1 , pts[0].se));
    vi X , Y;
    for(auto&p : pts) X.pb(p.fi) , Y.pb(p.se);
    sort(all(X));X.erase(unique(all(X)),X.end());
    sort(all(Y));Y.erase(unique(all(Y)),Y.end());
    for(auto&p : pts) p = mp(lower_bound(all(X),p.fi)-X.begin() ,
        lower_bound(all(Y),p.se)-Y.begin());
    rep(i,0,n) res[(i+s)%n] = pts[i];
  }
  return res;
}

int main(){
  cin >> n;
  int deg = 0;
  rep(i,0,n) {
    cin >> a[i];
    deg += 180 - a[i];
  }
  if(deg != 360) {
    cout << -1 << endl;
    return 0;
  }
  vi degs;
  rep(i,0,n) degs.pb(a[i]);
  vector<pii> pts = solve(degs);
  for(auto p : pts)
    cout << p.fi << " " << p.se << endl;
  return 0;
}
