Problem: Fifa and Fafa are sharing a flat. Fifa loves video games and wants to download a new soccer game. Unfortunately, Fafa heavily uses the internet which consumes the quota. Fifa can access the internet through his Wi-Fi access point. This access point can be accessed within a range of r meters (this range can be chosen by Fifa) from its position. Fifa must put the access point inside the flat which has a circular shape of radius R. Fifa wants to minimize the area that is not covered by the access point inside the flat without letting Fafa or anyone outside the flat to get access to the internet.

The world is represented as an infinite 2D plane. The flat is centered at (x1, y1) and has radius R and Fafa's laptop is located at (x2, y2), not necessarily inside the flat. Find the position and the radius chosen by Fifa for his access point which minimizes the uncovered area.

Input

The single line of the input contains 5 space-separated integers R, x1, y1, x2, y2 (1 ≤ R ≤ 105, |x1|, |y1|, |x2|, |y2| ≤ 105).

Output

Print three space-separated numbers xap, yap, r where (xap, yap) is the position which Fifa chose for the access point and r is the radius of its range. 

Your answer will be considered correct if the radius does not differ from optimal more than 10 - 6 absolutely or relatively, and also the radius you printed can be changed by no more than 10 - 6 (absolutely or relatively) in such a way that all points outside the flat and Fafa's laptop position are outside circle of the access point range.

Examples

Input

5 3 3 1 1


Output

3.7677669529663684 3.7677669529663684 3.914213562373095


Input

10 5 5 5 15


Output

5.0 5.0 10.0

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.StringTokenizer;


public class Main {

	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskC solver = new TaskC();
		solver.solve(1, in, out);
		out.close();
	}

	static class TaskC {
		public void solve(int testNumber, InputReader in, PrintWriter out) {
			int R = in.nextInt() ; 
			int x1  =in.nextInt() ; 
			int y1 = in.nextInt(); 
			int x2 = in.nextInt() ; 
			int y2 = in.nextInt() ; 


			double lx = 1l*(x2-x1)*(x2-x1) ; 
			double ly = 1l*(y2-y1)*(y2-y1) ; 
			double l = Math.sqrt(lx+ly) ;
			if(l>=R)
			{
				out.println(x1+" "+y1+" "+R);
				return; 
			}
			double r2 = R- l ;
			double r1 = (2*R - r2)/2 ;
			double xap1 ; 
			double yap1 ;

			if(x2==x1)
			{
				xap1= x1 ;
				yap1 = y2 + r1 ; 
				lx = (xap1-x1)*(xap1-x1) ; 
				ly = (yap1-y1)*(yap1-y1) ; 
				l = Math.sqrt(lx+ly) ;
				if(l<=R)
				{
					out.print(xap1+" "+yap1+" "+r1);
					return ;
				}
				yap1= y2-r1 ;
				out.print(xap1+" "+yap1+" "+r1);
				return  ;
			}
			double dy = 1.0*(y2-y1) ; 
			double dx = 1.0*(x2-x1) ;
			double m = dy/dx ; 
			double cy = y1 - (m*x1) ; 
			double a = 1+(m*m) ; 
			double d = y2-cy;
			double b = (-2l*x2)+(-2l*m*d) ;
			double c = (1l*d*d) - (1l*r1*r1) + (1l*x2*x2) ;

			if(a==0){
				xap1 = -1.0*c/b ;
				yap1 = m*xap1 + cy ; 
				out.print(xap1+" "+yap1+" "+r1);
			}
			else {
				xap1 = (-1*b)+Math.sqrt((1l*b*b)-(4l*a*c)) ; 
				xap1 = xap1/(2*a) ;
				yap1 = m*xap1 + cy ; 

				lx = 1l*(xap1-x1)*(xap1-x1) ; 
				ly = 1l*(yap1-y1)*(yap1-y1) ; 
				l = Math.sqrt(lx+ly) ;

				double xap2 = (-1*b)-Math.sqrt((1l*b*b)-(4l*a*c)) ; 
				xap2 = xap2/(2*a) ; 

				double yap2 = m*xap2 + cy ; 


				lx = 1l*(xap2-x1)*(xap2-x1) ; 
				ly = 1l*(yap2-y1)*(yap2-y1) ; 
				double l2 = Math.sqrt(lx+ly) ;

				if(l<l2)
					out.print(xap1+" "+yap1+" "+r1);
				else
					out.print(xap2+" "+yap2+" "+r1);





			}


		}
		public static double binarySearch(ArrayList<Double> arr, int l, int r)   /// begin by 0 and n-1
		{
			if(arr.size() == 1)
				return arr.get(0) ; 
			if(arr.size() ==2)
				return Math.min(arr.get(0),arr.get(1)) ;
			if(arr.get(r)<arr.get(r-1))
				return arr.get(r-1) ;
			if(arr.get(0)< arr.get(1))
				return arr.get(0) ; 

			if (r>=l)
			{
				int mid = l + (r - l)/2;
				if (mid >l && arr.get(mid-1)>= arr.get(mid) && mid<r-1 && arr.get(mid+1)>=arr.get(mid))
					return arr.get(mid);
				if (mid >l && arr.get(mid-1)>= arr.get(mid) && mid<r-1 && arr.get(mid+1)<=arr.get(mid))
					return binarySearch(arr, mid+1, r);

				return binarySearch(arr, l, mid);

			}
			return -1;
		}



	}

	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public InputReader(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(stream), 32768);
			tokenizer = null;
		}

		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}

	}
}