/*
これを入れて実行
g++ code.cpp
./a.out
 */
 
#include <iostream>
#include <cstdio>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include <functional>
#include <cassert>
#include <random>

#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
 
using namespace std;
typedef long long ll;
typedef long double ld;
 
int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
 
const long long INF = 1LL << 61;
const ll MOD = 1e9 + 7;
 
bool greaterSecond(const pair<int, int>& f, const pair<int, int>& s){
    return f.second > s.second;
}
 
ll gcd(ll a, ll b){
	if (b == 0)return a;
	return gcd(b, a % b);
}
 
ll lcm(ll a, ll b){
    return a / gcd(a, b) * b;
}

ll conbinationMemo[201][12];

void cmemoInit(){
    rep(i, 201){
        rep(j, 12){
            conbinationMemo[i][j] = -1;
        }
    }
}
 
ll nCr(ll n, ll r){
    if(conbinationMemo[n][r] != -1) return conbinationMemo[n][r];
    if(r == 0 || r == n){
        return 1;
    } else if(r == 1){
        return n;
    }
    return conbinationMemo[n][r] = (nCr(n - 1, r) + nCr(n - 1, r - 1));
}
 
ll nPr(ll n, ll r){
    r = n - r;
    ll ret = 1;
    for (ll i = n; i >= r + 1; i--) ret *= i;
    return ret;
}
//-----------------------ここから-----------

int main(void){
    ld n;
    cin >> n;
    ld x0, y0, xh, yh;
    cin >> x0 >> y0 >> xh >> yh;
    pair<ld, ld> cent = {(x0 + xh) / 2.0, (y0 + yh) / 2.0};
    ld xz, yz;
    xz = x0 - cent.first;
    yz = y0 - cent.second;

    ld deg = atan2(yz, xz);
    deg += (2.0 * M_PI) / n;
    ld d = sqrt(xz * xz + yz * yz);
    pair<ld,ld> ans = {cos(deg) * d, sin(deg) * d};

    ans.first += cent.first;
    ans.second += cent.second;

    cout << fixed << setprecision(10) << ans.first << " " << ans.second << endl;
}
#include <bits/stdc++.h>

using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
using ll = long long;
using P = pair<ll,ll>;
using vi = vector<int>;
const ll INF = 1009009009009009009;

int n;
double PI = acos(-1);

int main(){
    cin >> n;

    double x,y;
    cin >> x >> y;
    complex<double> c0(x,y);
    cin >> x >> y;
    complex<double> c2(x,y);

    complex<double> center = (c0+c2)/2.0;

    complex<double> rot(cos(2*PI/n),sin(2*PI/n));

    complex<double> r = ((c0-c2)/2.0) * rot;

    complex<double> ans = center + r;

    printf("%.12f %.12f\n",ans.real(),ans.imag());



}