#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;

int main()
{   int n,x1,x2,y1,y2,b,i,l1;
    const double PI  =3.141592653589793238463;
    double d,l,x;
    cin>>x1>>y1;
    cin>>x2>>y2;
    cin>>b;
    l =0;
    x = 0;
    n = 0;
    i =0;
    double a = 25*PI/180;
    x = sqrt(2-2*cos(25*180/PI));
    d = sqrt((x1-x2)^2+(y1-y2)^2);
    while ((l+x)<=d){
        i++;
        l+=x;
    }
    if ((d-l)<0000000.1){

    }
    else{
        l1 = l-x;
    }
    return 0;
}