import java.util.*;
import java.util.Map.Entry;
 
class Main {
	 static int mod =  (int) (Math.pow(10,9)+7);
	 static int[] ans;
//	 static int mod = 998244353;
   public static void main(String[] args) {
	          
	   Scanner sc = new Scanner(System.in);
       long  N = sc.nextLong();
       long  A = sc.nextLong();
       long  B = sc.nextLong();
       long ans1=0;
       long ans2=0;
       
       ans1=A*(N/(A+B));
       ans2=B*(N/(A+B));
       if(N%(A+B)<A) {
    	   ans1=ans1+N%(A+B);
       } else {
    	   ans1=ans1+A;
    	   ans2=ans2+N%(A+B)-A;
       }
       
       
       System.out.println(ans1); 
       return;
   }

}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz