#include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <vector>
using namespace std;

typedef complex<double> pt;

int main()
{
  double pi=atan(1.0)*4;
  cout<<setiosflags(ios::fixed)<<setprecision(3);
  ifstream cin("polygon.in");
  for (int n;cin>>n;){
    static bool fst=true;
    if (fst) fst=false;
    else cout<<endl;
    vector<pt> pts(n);
    vector<pt> args(n);
    for (int i=0;i<n;i++){
      double x,y;cin>>x>>y;
      pts[i]=pt(x,y);
    }
    for (int i=0;i<n;i++){
      double deg;cin>>deg;
      args[i]=polar(1.0,deg/180.0*pi);
    }
    pair<pt,pt> pol=make_pair(pt(1,0),0);
    for (int i=0;i<n;i++){
      pol.first*=args[i];
      pol.second*=args[i];
      int j=(i+1)%n;
      pol.second-=pts[j]-pts[i];
    }
    pt z=(-pol.second)/(pol.first-pt(1,0));
    for (int i=0;i<n;i++){
      pt c=pts[i]+z;
      cout<<real(c)<<" "<<imag(c)<<endl;
      z*=args[i];
      int j=(i+1)%n;
      z-=pts[j]-pts[i];
    }
  }
  return 0;
}