using System; using System.Collections.Generic; using System.Collections; using System.Collections.Specialized; using System.Linq; using System.Text; using System.IO; using System.Reflection; using static System.Math; using System.Numerics; static class Program{ const int mod=(int)1e9+7; const double eps=1e-11; static void Main(){ Sc sc=new Sc(); var n=sc.I; var s=sc.Ia; var pq=new Rheap>(32); pq.Push(new Rheap>.Dt(s[0],Tuple.Create(1,1))); while(true){ var e=pq.Dequeue; if(e.d.Item1>=n){ Console.WriteLine(e.n); break; } if(e.d.Item1>e.d.Item2){ pq.Push(new Rheap>.Dt(e.n+s[0],Tuple.Create(e.d.Item1,e.d.Item1))); } pq.Push(new Rheap>.Dt(e.n+s[1],Tuple.Create(e.d.Item1+e.d.Item2,e.d.Item2))); } } } public class Rheap{ public class Dt{ public long n; public T d; public Dt(long n,T d){this.n=n;this.d=d;} public override string ToString()=>"d:"+d.ToString()+" n:"+n.ToString(); } private const int m=65; private long la=0; private Dt[][] bf; private int[] h; public int cnt=0; public Rheap(int max){ bf=new Dt[m][]; h=new int[m]; for(int i = 0;i0){ int p=0; for(int j = 1;jbf[i][j].n){p=j;} } la=bf[i][p].n; for(int j = 0;j(int n,Func f){var a=new T[n];for(int i=0;i(int n,Func f){var a=new T[n];for(int i=0;i(int n,Func f){var a=new T[n];for(int i=0;i(int n,Func f){var a=new T[n];for(int i=0;i