using System; using System.IO; using System.Collections.Generic; using System.Globalization; using System.Linq; using System.Text; partial class Solver { double InfiniteGeometricProgressionSum(double x0, double r) { return x0 / (1.0 - r); } void Merge(double p1, double q1, double p2, double q2, out double rp, out double rq) { // back: // p1 + // q1 * p2 * q1 + // q1 * p2 * p1 * p2 * q1 // .. // q1 * p2 * (p1 * p2)^K * q1 rp = p1 + InfiniteGeometricProgressionSum(q1 * q1 * p2, p1 * p2); // forward // q1 + // q1 * q2 // q1 * p2 * p1 * q2 // .. // q1 * (p2 * p1) ^ K * q2 rq = q1 + InfiniteGeometricProgressionSum(q1 * q2, p1 * p2); } public void Run() { var N = ni(); var p = nd(); var q = nd(); double mergedP = p; double mergedQ = q; for (int i = 0; i < N - 1; i++) { Merge(mergedP, mergedQ, p, q, out p, out q); } cout.WriteLine(p); } } // PREWRITEN CODE BEGINS FROM HERE partial class Solver : Scanner { public static void Main(string[] args) { new Solver(Console.In, Console.Out).Run(); } TextReader cin; TextWriter cout; public Solver(TextReader reader, TextWriter writer) : base(reader) { this.cin = reader; this.cout = writer; } public Solver(string input, TextWriter writer) : this(new StringReader(input), writer) { } public int ni() { return NextInt(); } public int[] ni(int n) { return NextIntArray(n); } public long nl() { return NextLong(); } public long[] nl(int n) { return NextLongArray(n); } public double nd() { return NextDouble(); } public string ns() { return Next(); } public string[] ns(int n) { return NextArray(n); } } public class Scanner { private TextReader Reader; private Queue TokenQueue = new Queue(); private CultureInfo ci = CultureInfo.InvariantCulture; public Scanner() : this(Console.In) { } public Scanner(TextReader reader) { this.Reader = reader; } public int NextInt() { return Int32.Parse(Next(), ci); } public long NextLong() { return Int64.Parse(Next(), ci); } public double NextDouble() { return double.Parse(Next(), ci); } public string[] NextArray(int size) { var array = new string[size]; for (int i = 0; i < size; i++) array[i] = Next(); return array; } public int[] NextIntArray(int size) { var array = new int[size]; for (int i = 0; i < size; i++) array[i] = NextInt(); return array; } public long[] NextLongArray(int size) { var array = new long[size]; for (int i = 0; i < size; i++) array[i] = NextLong(); return array; } public String Next() { if (TokenQueue.Count == 0) { if (!StockTokens()) throw new InvalidOperationException(); } return TokenQueue.Dequeue(); } public bool HasNext() { if (TokenQueue.Count > 0) return true; return StockTokens(); } private bool StockTokens() { while (true) { var line = Reader.ReadLine(); if (line == null) return false; var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries); if (tokens.Length == 0) continue; foreach (var token in tokens) TokenQueue.Enqueue(token); return true; } } }