def EqualNumbers(a):
n = len(a)
for i in range(0, n):
while a[i] % 2 == 0:
a[i] //= 2
while a[i] % 3 == 0:
a[i] //= 3
if a[i] != a[0]:
return print("No")
return print("Yes")
def main():
n = int(input())
a = list(map(int, input().split()))
EqualNumbers(a)
main()
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
long long a[n];
for(int i=0;i<n;i++){
cin>>a[i];
while(a[i]%3==0){
a[i]/=3;
}
while(a[i]%2==0){
a[i]/=2;
}
}
int flag=0;
for(int i=0;i<n-1;i++){
if(a[i]!=a[i+1]){
flag=1;
cout<<"No";
goto end;
}
}
if(flag==0){
cout<<"Yes";
}
end:
return 0;
}
221. Maximal Square | 1200. Minimum Absolute Difference |
1619B - Squares and Cubes | 1619A - Square String |
1629B - GCD Arrays | 1629A - Download More RAM |
1629C - Meximum Array | 1629D - Peculiar Movie Preferences |
1629E - Grid Xor | 1629F1 - Game on Sum (Easy Version) |
2148. Count Elements With Strictly Smaller and Greater Elements | 2149. Rearrange Array Elements by Sign |
2150. Find All Lonely Numbers in the Array | 2151. Maximum Good People Based on Statements |
2144. Minimum Cost of Buying Candies With Discount | Non empty subsets |
1630A - And Matching | 1630B - Range and Partition |
1630C - Paint the Middle | 1630D - Flipping Range |
1328A - Divisibility Problem | 339A - Helpful Maths |
4A - Watermelon | 476A - Dreamoon and Stairs |
1409A - Yet Another Two Integers Problem | 977A - Wrong Subtraction |
263A - Beautiful Matrix | 180C - Letter |
151A - Soft Drinking | 1352A - Sum of Round Numbers |