#include<bits/stdc++.h>#define ll long longusingnamespace std;
ll gcd(ll a,ll b){
return b?gcd(b,a%b):a;}int mod =1e9+7;
ll a[110];intmain(){
int n;
cin>>n;for(int i =1;i <= n;i++){
cin>>a[i];}
ll res =0;for(int i =1;i <= n;i++){
for(int j = i +1;j <= n;j++){
res =(res +(ll)a[i]/gcd(a[i], a[j])* a[j]% mod)% mod;}}
cout<<res;return0;}
#include<bits/stdc++.h>#define ll long longusingnamespace std;intmain(){
string s;
cin>>s;
ll n;
cin>>n;
ll res =0, hh =0, mm =0, ss =0;
hh =(s[0]-'0')*10+(s[1]-'0');
mm =(s[3]-'0')*10+(s[4]-'0');
ss =(s[6]-'0')*10+(s[7]-'0');
res += ss;
res += mm *60;
res += hh *60*60;
res += n;
ss = res %60;
res /=60;
mm = res %60;
res /=60;
hh = res;
hh %=24;if(hh <10) cout<<"0";
cout<<hh<<":";if(mm <10) cout<<"0";
cout<<mm<<":";if(ss <10) cout<<"0";
cout<<ss;return0;}
#include<bits/stdc++.h>#define ll long longusingnamespace std;struct node {
string s;int a, b, c;double sum;booloperator<(node t){
if(sum == t.sum){
if(a == t.a){
if(b == t.b)return c > t.c;return b > t.b;}return a > t.a;}return sum > t.sum;}}a[1010];int n;intmain(){
cin>>n;for(int i =0;i < n;i++){
cin>>a[i].s>>a[i].a>>a[i].b>>a[i].c;
a[i].sum = a[i].a *0.4+ a[i].b *0.35+ a[i].c *0.25;}sort(a, a + n);for(int i =0;i <3;i++){
cout<<a[i].s<<" ";printf("%.1f\n", a[i].sum);}return0;}