#include <string>
#include <vector>

using namespace std;

struct list{
    int time;
    int last;
    int next;
    list() : time(0), last(0), next(0) {}
    list(int c1, int c2, int c3) : time(c1), last(c2), next(c3) {}
};
typedef struct list list;

long long solution(int n, vector<int> times) {
    long long answer = 0;
    unsigned long long sum=1;
    
    list list1;
    
    for(int i=0; i<times.size(); i++){
        sum*=times[i];
    }
    
    int a[100000], newsum;
    
    for(int i=0; i<times.size(); i++){
        a[i]=sum/times[i];
        newsum+=a[i];
    }
    
    if(n>newsum){
        n-=newsum;
    }
    else if(n<newsum){
        
    }
    else if(n==newsum){
        return newsum*(n/times[times.size()-1]);
    }
    
    return answer;
}