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.awt.List;
		    		import java.io.*;
		import java.math.BigInteger;
		import java.util.*;
		
		    		
		    		
		    		/*
		    		 * 
		    		 * daiict
		    		 *
		    		 * 
		    		 * 
		    		 */
		    		
		    		
		    		public class pprac {
		    			 FastScanner in;
		    			 PrintWriter out;
		    		
		    			static ArrayList[] adj;
		    			static ArrayList[] aadj;
		    		    static int last;
		    			static int n;
		    			static int m;
		    			
		    			static int[] dp1;
		    			static int[] dp2;
		    			static int color[];
		    			static int visited[];
		    			static int[] arr;
		    			static long[] brr;
		    			static double ans;
		    			static int array[];
		    			static int start[];
		    			static int finish[];
		    			static int pref[];
		    			static int tree[];
		    			static int maxval = 32;
		    		
		    			static int ttt[];
		    			static int sum = 0;
		    			static String s;
		    		
		    			static int cc = 0;
		    			static long min = Long.MAX_VALUE;
		    			
		    			static ArrayList<Integer> segt[];
		    			
		    		//for dfs do not delete
		    			static int dir[][] ={{1,0},{0,1},{0,-1},{-1,0}};
		    			
		    		
		    			static int[] seg;
		    			static long count = 1;
		    			static long mod = (long)1e9 + 7;
		    	
		    			static int parent[];
		    			static int size[];
		    			
		    		    static int[] l;
		    		    static int[] r;
		    		    static int[] next;
		    		    static int[] cnt;
		    		    static int[] block;
		    		    
		    			static HashSet<String> set;
		    			static HashSet<String> set2;
		    			
		    			static int low[];
		    			static int disc[];
		    			static int time;
		    			static int acn[];
		    			
		    			static class Pair implements Comparable<Pair>
		    		    {
		    				int x;int y;
		    				
		    		        Pair(int l, int m) {
		    		          
		    		        	this.x = l;
		    		            this.y = m;
		    		          
		    		        }
		    		        
		    		        public int compareTo(Pair p) {
		    		      
		    		        	
		    		            if (this.x == p.x) {
		    		                return (int)(this.y-p.y);
		    		            }
		    		            return (int)(this.x - p.x);
		    		        }
		    		        
		    		        public String toString(){
		    		        	return x + " " + y;
		    		        }
		    		        
		    		        public boolean equals(Object o){
		    		        	if(o instanceof Pair){
		    		        		Pair a = (Pair)o;
		    		        		
		    		        		return this.x == a.x;
		    		        	}
		    		        	
		    		        	return false;
		    		        }
		    		        
		    		        public int hashCode(){
		    		        	return new Long(x).hashCode()*31 + new Long(y).hashCode();
		    		        }
		    		    
		    		    }
		    		    
		    			
		    			public static int gcd(int a, int b) {
		    				if (b == 0) return a;
		    				return gcd(b, a%b);
		    			}
		    	
		    			void build(int n) {  // build the tree
		  				  for (int i = n - 1; i > 0; --i) seg[i] = seg[i<<1]+seg[i<<1|1];
		  				}
	
		  			public static void modify(int p, int val,int n) {  // set value at position p
		  				  for (seg[p += n] = val; p > 1; p >>= 1) seg[p>>1] = seg[p] + seg[p^1];
		  				}
	
		  				int query(int l, int r,int n) {  // sum on interval [l, r)
		  				  int res = 0;
		  				  for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
		  				    if ((l&1) == 1) res += seg[l++];
		  				    if ((r&1) == 1) res += seg[--r];
		  				  }
		  				  return res;
		  				}
		    				
//		    			public static void update(int x,int val){
//		    				while(x<=maxval){
//		    					tree[x] += val;
//		    					x = (x&-x);
//		    				}
//		    			}
		    			
		    			public static int read(int idx){
		    				int sum = 0;
		    				
		    				while(idx>= 0){
		    					sum += tree[idx];
		    					idx -= (idx&(-idx));
		    				}
		    				
		    				return sum;
		    			}
		    			
		    			public static int find(int i){
		    				if(parent[i] != i){
		    					return find(parent[i]);
		    				}
		    				
		    				return i;
		    			}
		    			
		    			public static void union(int a,int b){
		    				int x = find(a);
		    				int y = find(b);
		    				
		    				if(x!=y){
		    					if(size[x] > size[y]){
		    						size[x] += size[y];
		    						parent[y] = x;
		    					}else{
		    						size[y] += size[x];
		    						parent[x] = y;
		    				}
		    				}
		    			}
		    			
		    			
		    			
		    			
		    			
		    		    /*static */ void solve() throws NumberFormatException,InputMismatchException, IOException {
		    		    
		    		 //   	Scanner in = new Scanner(System.in);
		    		   
		    		    	double r = in.nextDouble();
		    		    	double x = in.nextDouble();
		    		    	double y = in.nextDouble();
		    		    	
		    		    	double xx = in.nextDouble();
		    		    	double yy = in.nextDouble();
		    		    	
		    		    	double a = 0 ;
		    		    	double b = 0;
		    		    	
		    		    	double d = Math.sqrt( (xx-x)*(xx-x) + (yy-y)*(yy-y) );
  		    	
		    		    	if(d >= r){
		    		    		out.println(x + " " + y + " " + r);
		    		    		return;
		    		    	}else if(d == 0){
		    		    		double e = 0;
		    		    		out.println(((x+r/2.0+e) + " " + ((y+e)) + " " + ((r/2.0)-e)));
		    		    		return;	    		    	
		    		    	}
		    		    	
		    		    	double rr = (r+d)/2;
		    		  
		    		    	a = xx + rr*((x-xx)/d);
		    		    	b = yy + rr*((y-yy)/d);
		    		    	
		    		    	
		    		    	out.println(a + " " + b + " " +rr);		
		    		    	
		    		    }
		    		    
		    		    public static void uu(int arr[],int i,int f){
		    		    	if(i == 1){
		    		    		return;
		    		    	}
		    		    	int next = i/2;
		    		    	int x = 0;
		    		    	if(i%2 == 0){
		    		    		x = i+1;
		    		    	}else{
		    		    		x = i-1;
		    		    	}
		    		    	
		    		    	if(f == 1){
		    		    		arr[next] = arr[i] ^ arr[x];
		    		    	}else{
		    		    		arr[next] = arr[i]|arr[x];
		    		    	}
		    		    	
		    		    	uu(arr,next,1-f);
		    		    }
		    		    
		    		   
			    
		    		   
		    		  
		    		
		    		    public static String reverse(String s){
		    		    	
		    		    	String ans = "";
		    		    	
		    		    	for(int i = s.length()-1;i>=0;i--){
		    		    		ans += s.charAt(i);
		    		    	}
		    		    	
		    		    	return ans;
		    		    	
		    		    }
		    			
		    			
		    		    
		    		 
		    		    public static long sum(long x){
		    		    	return x<10?x:x%10 + sum(x/10);
		    		    }
		    			
		    			public static long gcd(long x, long y) {
		    				if (x == 0)
		    					return y;
		    				else
		    					return gcd( y % x,x);
		    			}
		    			static long inv(long x , long mod)
		    			{
		    				long r,y;
		    				for(r=1,y=mod-2;y!=0;x=x*x%mod,y>>=1)
		    				{
		    					if((y&1)==1)
		    						r=r*x%mod;
		    				
		    				}
		    				return r;
		    			}
		    			
		    			public static long pow(long x,long y,long n){
		    				if(y==0)
		    					return 1%n;
		    				if(y%2==0){
		    					long z=pow(x,y/2,n);
		    					return (z*z)%n;
		    				}
		    				return ((x%n)*pow(x,y-1,n))%n;
		    			}
		    			
		    			
		    			
		    			
		    			public static boolean isPrime(long a) {
		    				// Corner cases
		    				if (a <= 1)
		    					return false;
		    				if (a <= 3)
		    					return true;
		    		 
		    				// This is checked so that we can skip 
		    				// middle five numbers in below loop
		    				if (a % 2 == 0 || a % 3 == 0)
		    					return false;
		    		 
		    				for (long i = 5; i * i <= a; i = i + 6)
		    					if (a % i == 0 || a % (i + 2) == 0)
		    						return false;
		    		 
		    				return true;
		    			}
		    			
		    		
		    			void run() throws NumberFormatException, InputMismatchException,IOException {
		    				in = new FastScanner();
		    				out = new PrintWriter(System.out);
		    		
		    				solve();
		    		
		    				out.close();
		    			}
		    		
		    			class FastScanner {
		    				BufferedReader br;
		    				StringTokenizer st;
		    		
		    				public FastScanner() {
		    					br = new BufferedReader(new InputStreamReader(System.in));
		    				}
		    		
		    				String next() {
		    					while (st == null || !st.hasMoreTokens()) {
		    						try {
		    							st = new StringTokenizer(in.br.readLine());
		    						} catch (IOException e) {
		    							// TODO Auto-generated catch block
		    							e.printStackTrace();
		    						}
		    					}
		    					return st.nextToken();
		    				}
		    		
		    				int nextInt() {
		    					return Integer.parseInt(next());
		    				}
		    		
		    				long nextLong() {
		    					return Long.parseLong(next());
		    				}
		    		
		    				double nextDouble() {
		    					return Double.parseDouble(next());
		    				}
		    			}
		    			
		    			
		    			
		    			
		    		 
		    		
		    			public static void main(String[] args) throws NumberFormatException,InputMismatchException, IOException {
//		    				 new Thread(null ,new Runnable(){
//		    				       public void run(){
//		    				           try{
//		    				        		
//		    				               test();
//
//		    				           } catch(Exception e){
//		    				               e.printStackTrace();
//		    				           }
//		    				       }
//		    				   },"1",1<<26).start();
//		    				   	   }
//		    				    static StringBuilder sb;
//		    				    public static void test() throws IOException{
//		    				    	 sb=new StringBuilder();
//		    				    	int t=1;
//		    				    	while(t-->0){
//		    				    		
//		    				    		solve();
//		    				    		
//		    				    	}
//		    				    	

	    				    new pprac().run();
		    			}
		    				    
		    			
		    		}
		    		class Node{
		    			int a;
		    			int b;
		    			public Node(int i, int j) {
							this.a = i;
							this.b = j;
							
						}
					
		    			
		    		}
		    		
		    		class MyComp implements Comparator<String>{
		    		    
		    			int c = 0;
		    			
		    			MyComp(int d){
		    				c = d;
		    			}
		    			
		    			@Override
		    			public int compare(String a,String b) {
		    				
		    				// < == -1
		    				
		    				String arr[] = a.split(" ");
		    				String brr[] = b.split(" ");
		    				
		    				return arr[c].compareTo(brr[c]);
		    				
		    				
		    			}
		
		    			
		    		}
		    		
		    		class MyComp2 implements Comparator<Node>{
		    		    
		    		
		    			
		    			@Override
		    			public int compare(Node a,Node b) {
		    				
		    				// < == -1
		
		    				
		    				if(a.b > b.b){
		    					return -1;
		    				}else{
		    					return 1;
		    				}
		    				
		    				
		    			}
		
		    			
		    		}