1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include<iostream>

using namespace std;
 
long long NWD(long long a, long long b){
	
  	long long pom;
 
    while(b!=0){
    	
      pom = b;
      b = a%b;
      a = pom;
	   
    }
    
    return a;
}
 
int main(){
  
	long long m,n,min=1000001;
	  
	cin >> m;
	  
	long long tab[m];
	  
	for(int i=0;i<m;i++){
	  	
		cin >> tab[i];
	  	
	}

	cin >> n;
	
	char a;
	bool t[n];
	
	for(int i=0;i<n;i++){
	
		cin >> a;
		
		t[i] = (a == 'W')? 1 : 0;
		
	}
	
/*
	for(int i=0;i<n;i++){
	
		cout << t[i] << " ";
		
	}
	
	if(m==n){
		
		
		
	}
	else if(m%n==0){
		
		
		
	}
	else{
		
		
		
	}
*/
	cout << m/NWD(m, n)*n << endl;
 
	return 0;
}