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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author yashk
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, InputReader in, OutputWriter out) {
            double r = in.nextDouble();
            double xr = in.nextDouble();
            double yr = in.nextDouble();
            double xfa = in.nextDouble();
            double yfa = in.nextDouble();
            Point pr = new Point(xr, yr);
            Point pfa = new Point(xfa, yfa);
            double xap = xr, yap = yr, rap = r;
            if (dist(xr, yr, xfa, yfa) >= r) {
                out.print(xap + " " + yap + " " + rap);
            } else {
                Point p1, p2, p3, p4, pc;
                double r1, r2, rc;
                if (xr == xfa) {
                    p1 = new Point(xr, yr + r);
                    p2 = new Point(xr, yr - r);
                    r1 = Math.abs(yfa - p1.y);
                    r2 = Math.abs(yfa - p2.y);
                    if (r1 > r2) {
                        pc = new Point(xr, (p1.y + yfa) / 2);
                        rc = r1 / 2;
                    } else {
                        pc = new Point(xr, (yfa + p2.y) / 2);
                        rc = r2 / 2;
                    }
                    out.print(pc.x + " " + pc.y + " " + rc);
                } else if (yr == yfa) {
                    p1 = new Point(xr - r, yr);
                    p2 = new Point(xr + r, yr);
                    r1 = Math.abs(xfa - p1.x);
                    r2 = Math.abs(xfa - p2.x);
                    if (r1 > r2) {
                        pc = new Point((xfa + p1.x) / 2, yr);
                        rc = r1 / 2;
                    } else {
                        pc = new Point((p2.x + xfa) / 2, yr);
                        rc = r2 / 2;
                    }
                    out.print(pc.x + " " + pc.y + " " + rc);
                } else {
                    p1 = calculateLine(pr, pfa, r);
                    p2 = calculateLine2(pr, pfa, r);
                    r1 = dist(p1.x, p1.y, pfa.x, pfa.y);
                    r2 = dist(p2.x, p2.y, pfa.x, pfa.y);
                    if (r1 > r2) {
                        pc = new Point((p1.x + pfa.x) / 2, (p1.y + pfa.y) / 2);
                        rc = r1 / 2;
                    } else {
                        pc = new Point((p2.x + pfa.x) / 2, (p2.y + pfa.y) / 2);
                        rc = r2 / 2;
                    }
                    out.print(pc.x + " " + pc.y + " " + rc);
                }
            }
        }

        double dist(double x1, double y1, double x2, double y2) {
            double x = x2 - x1;
            double y = y2 - y1;
            return Math.sqrt(x * x + y * y);
        }

        private Point calculateLine(Point x1, Point x2, double distance) {
            double length = dist(x1.x, x1.y, x2.x, x2.y);
            double unitSlopeX = (x2.x - x1.x) / length;
            double unitSlopeY = (x2.y - x1.y) / length;
            double x = x1.x + unitSlopeX * distance;
            double y = x1.y + unitSlopeY * distance;
            return new Point(x, y);
        }

        private Point calculateLine2(Point x1, Point x2, double distance) {
            double length = dist(x1.x, x1.y, x2.x, x2.y);
            double unitSlopeX = (x2.x - x1.x) / length;
            double unitSlopeY = (x2.y - x1.y) / length;
            double x = x1.x - unitSlopeX * distance;
            double y = x1.y - unitSlopeY * distance;
            return new Point(x, y);
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public double nextDouble() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            double res = 0;
            while (!isSpaceChar(c) && c != '.') {
                if (c == 'e' || c == 'E') {
                    return res * Math.pow(10, nextInt());
                }
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            }
            if (c == '.') {
                c = read();
                double m = 1;
                while (!isSpaceChar(c)) {
                    if (c == 'e' || c == 'E') {
                        return res * Math.pow(10, nextInt());
                    }
                    if (c < '0' || c > '9') {
                        throw new InputMismatchException();
                    }
                    m /= 10;
                    res += (c - '0') * m;
                    c = read();
                }
            }
            return res * sgn;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void print(Object... objects) {
            for (int i = 0; i < objects.length; i++) {
                if (i != 0) {
                    writer.print(' ');
                }
                writer.print(objects[i]);
            }
        }

        public void close() {
            writer.close();
        }

    }

    static class Point {
        double x;
        double y;

        public Point(double x, double y) {
            this.x = x;
            this.y = y;
        }


        public String toString() {
            return "Point [x=" + x + ", y=" + y + "]";
        }

    }
}