Problem: Harry Potter and He-Who-Must-Not-Be-Named engaged in a fight to the death once again. This time they are located at opposite ends of the corridor of length l. Two opponents simultaneously charge a deadly spell in the enemy. We know that the impulse of Harry's magic spell flies at a speed of p meters per second, and the impulse of You-Know-Who's magic spell flies at a speed of q meters per second.

The impulses are moving through the corridor toward each other, and at the time of the collision they turn round and fly back to those who cast them without changing their original speeds. Then, as soon as the impulse gets back to it's caster, the wizard reflects it and sends again towards the enemy, without changing the original speed of the impulse.

Since Harry has perfectly mastered the basics of magic, he knows that after the second collision both impulses will disappear, and a powerful explosion will occur exactly in the place of their collision. However, the young wizard isn't good at math, so he asks you to calculate the distance from his position to the place of the second meeting of the spell impulses, provided that the opponents do not change positions during the whole fight.

Input

The first line of the input contains a single integer l (1 ≤ l ≤ 1 000) — the length of the corridor where the fight takes place.

The second line contains integer p, the third line contains integer q (1 ≤ p, q ≤ 500) — the speeds of magical impulses for Harry Potter and He-Who-Must-Not-Be-Named, respectively.

Output

Print a single real number — the distance from the end of the corridor, where Harry is located, to the place of the second meeting of the spell impulses. Your answer will be considered correct if its absolute or relative error will not exceed 10 - 4. 

Namely: let's assume that your answer equals a, and the answer of the jury is b. The checker program will consider your answer correct if <image>.

Examples

Input

100
50
50


Output

50


Input

199
60
40


Output

119.4

Note

In the first sample the speeds of the impulses are equal, so both of their meetings occur exactly in the middle of the corridor.

Solution (in JAVA):

Solution:


import java.io.PrintWriter;

import java.util.*;
import java.util.Arrays ; 


public class Test{
    static int pos = 0 ; 
    static int  arr[] ; 
  static LinkedList l1 = new  LinkedList() ; 
static void find(int p ,char[]x,int put[],String s){
    int c= 0 ; 
    for (int i = 0; i < s.length(); i++) {
        if(x[p]==s.charAt(i)){
        c++ ; }
    }
    put[p] = c ;  
}
static int mode(int m ,int[]x ){
    int temp = 0 ; 
    for (int i = x.length-1; i >=0; i--) {
        if(x[i]<=m){
            temp= x[i] ; 
           /// break ; 
             return m-temp ; 
             
        }
    }
     return m-temp ; 
}
static int mode2(int m ,int[]x ){
    int temp = 0 ; 
    
    for (int i = x.length-1; i >=0; i--) {
        if(x[i]<=m){
            temp= x[i] ; 
           /// break ; 
             return x[i] ; 
             
        }
    }
     return 0 ; 
}
static int find(int x[],int temp){
    int j = 0 ; 
    for (int i = x.length-1; i >=0; i--) {
        if(x[i]==temp) return j+1 ; 
        j++ ; 
    }
    return -1 ; 
}
static String ch(long[]x,long b){
    for (int i = 0; i < x.length; i++) {
        if(x[i]==b)return "YES" ;
    }
    return "NO" ; 
}
static int pis(String s,char k ){
  
    for (int i = 0; i < s.length(); i++) {
        if(k==s.charAt(i) ) {
            return i ;
        } 
    }
   
    return -1 ; 
    
}
static  int fin(String s){
   int count = 0 ; 
    for (int i = 0; i < s.length(); i++) {
       if(s.charAt(i)>=65&&s.charAt(i)<=90) count++ ; 
    }
   return count ; 
}
static boolean config(int[]x ){
    for (int i = 0; i < x.length; i++) {
        if(x[i]==0) return false ;
    }
    return true  ; 
}
static long count(long i ){
    if(i%2==0){
        return i ; 
    }else return i+count(i-1) ;  
}
static boolean ce(int [][]x){
    for (int i = 0; i < x.length; i++) {
        if(x[i][0]!=x[i][1]) return true ; 
    }
    
    return false ;
}
static boolean c(int[][]x,int[]y){
    int j=y.length-1 ; 
    for (int i = 0; i < x.length; i++) {
        if(x[i][1]!=y[j]) return true;
        j-- ;
    }
    return false  ; 
}
static long gcd(long a , long b){
    if(b==0) return a ; 
    else return gcd(b,a%b) ; 
    
}
    public static void main(String[] args)  {

        Scanner in = new Scanner(System.in) ;
        PrintWriter pw = new PrintWriter(System.out);
        int n = in.nextInt() ; 
        float   h = in.nextFloat();
        float   z = in.nextFloat();
        float time= n/(z+h) ; 
        float temp = time*h; 
        System.out.println(temp);
                 pw.close();
    }
}