#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{ll n,a,b,m;cin>>n;for(int i = 1;i <= n;i ++){cin>>m>>a>>b;if(a*2 <= b)cout<<m*a<<endl;else{if(m%2==0) cout<<m/2*b<<endl;else cout<<m/2*b+a<<endl;}}return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int M = 2e5+10;
int x[M],a[M],b[M],n;
int main()
{cin>>n;for(int i = 1;i <= n;i ++){cin>>x[i];}for(int i = n;i >= 1;i --){a[i] = a[i+1]; b[i] = b[i+1];if(i%2==0)a[i] += x[i];elseb[i] += x[i];}int ans = 0;for(int i = 1;i <= n;i ++){int ans1 = a[1] - a[i];int ans2 = b[1] - b[i];//cout<<ans1<<" "<<ans2<<endl;ans1 += b[i+1];ans2 += a[i+1];// cout<<ans1<<" "<<ans2<<endl;if(ans1 == ans2)  ans++;}cout<<ans<<endl;return 0;
}

#include<bits/stdc++.h>
using namespace std;
const int M = 1e3+10;
queue<int>v;
queue<int>v2;
int mp[M],n,x;
int g[30][30];
int v1[M];
int main()
{int flag = 1,tot = 0;cin>>n;for(int i = 1;i <= n*n;i ++){cin>>x;mp[x] ++;if(mp[x] == 1) v.push(x),v1[++tot]=x;}if(n%2==0){for(int i = 1;i <= n/2;i ++){for(int j = 1;j <= n/2;j ++){int now = v.front();if(mp[now]<4){flag = 0;break;}else if(mp[now] == 4){v.pop();mp[now] = 0;}elsemp[now] -= 4;g[i][j] = now; g[n-i+1][j] = now;g[n-i+1][n-j+1] = now; g[i][n-j+1]=now;}}}else{int cnt = 0,cnt1 = 0;for(int j = 1;j <= tot;j ++){int i = v1[j];if(mp[i]%2 == 1){cnt++,g[n/2+1][n/2+1] = i;if(mp[i]!=1)  mp[i]-=1;}if(mp[i]%4 == 2){cnt1++;v2.push(i);}}if(cnt > 1||cnt1 > n-1) flag = 0;for(int i = 1;i <= tot;i ++){if(mp[v1[i]]%4==0)v2.push(v1[i]);}for(int i = 1;i <= n/2;i ++){int now = v2.front();if(mp[now] == 2){v2.pop(); mp[now] = 0;}else if(mp[now]%4==2&&mp[now]>2){mp[now] -= 2;v2.pop(); v2.push(now);}else{mp[now] -= 2;}g[i][n/2+1] = now;g[n-i+1][n/2+1] = now;}for(int i = 1;i <= n/2;i ++){int now = v2.front();if(mp[now] == 2){v2.pop(); mp[now] = 0;}else if(mp[now]%4==2&&mp[now]>2){mp[now] -= 2,v2.pop(),v2.push(now);}else {mp[now]-=2;}g[n/2+1][i] = now;g[n/2+1][n-i+1] = now;}for(int i = 1;i <= n/2;i ++){for(int j = 1;j <= n/2;j ++){int now = v2.front();if(mp[now] == 2) {flag = 0;break;}else if(mp[now] == 4){mp[now] = 0; v2.pop();}else {mp[now] -= 4;}g[i][j] = now;g[n-i+1][j] = now;g[n-i+1][n-j+1]=now; g[i][n-j+1]=now;}}}if(flag){cout<<"YES"<<endl;for(int i = 1;i <= n;i ++){for(int j D2. Coffee and Coursework (Hard Version)= 1;j <= n;j ++){cout<<g[i][j]<<" ";}cout<<endl;}}else {cout<<"NO"<<endl;}
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll M = 2e5 + 10;
ll v[M],a[M];
bool cmp(ll x,ll y){return x > y;
}
int main()
{ll n,m,cnt = 0,ans = 0;cin>>n>>m;for(ll i = 1;i <= n;i ++){cin>>a[i];ans += a[i];}if(ans < m){cout<<-1<<endl;return 0;}ll en = n;sort(a+1,a+n+1,cmp);ll l = 1,r = n;while(l < r){ll mid = (l + r) >> 1;ll num = n/mid;for(ll i = 0;i <= num-1;i ++){for(ll j = 1;j <= mid;j ++){v[++cnt] = i;}}for(ll i = 1;i <= (n%mid);i ++)v[++cnt] = num;sort(v+1,v+1+cnt);ll kk = 0;for(ll i = 1;i <= cnt;i ++){kk += max(0*1LL,a[i]-v[i]);}for(ll i = 1;i<= cnt;i ++)v[i] = 0;cnt = 0;if(kk >= m) r = mid,en = mid;else l = mid+1;}cout<<en<<endl;
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){ll n,m,cnt = 0;cin>>n>>m;if(n > m*(m-1)) cout<<"NO"<<endl;else {cout<<"YES"<<endl;for(ll i = 1;i <= m;i ++){for(ll j = i+1;j <= m;j ++){cout<<i<<" "<<j<<endl;cnt++;if(cnt == n) return 0;cout<<j<<" "<<i<<endl;cnt++;if(cnt == n) return 0;}}}return 0;
}

#include<bits/stdc++.h>
using namespace std;
const int M = 3e5+10;
vector<int>g[M];
struct node{int x,y;
}q[M];
int n,m,a1,b1,a[M],cnt;
void dfs(int u,int fa){if(a[u]==1) q[u].x++;else if(a[u]==2) q[u].y++;for(int i = 0;i < g[u].size();i ++){int v = g[u][i];if(v == fa) continue;dfs(v,u);q[u].x += q[v].x; q[u].y += q[v].y;}if((q[u].x == a1&&q[u].y==0)||(q[u].y==b1&&q[u].x==0))cnt++;return ;
}int main()
{ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);cin>>n;for(int i = 1;i <= n;i ++){cin>>a[i];if(a[i] == 1) a1++;else if(a[i] == 2) b1 ++;}int x,y;for(int i = 2;i <= n;i ++){cin>>x>>y;g[x].push_back(y);g[y].push_back(x);}dfs(1,0);cout<<cnt<<endl;
}