Sasha grew up and went to first grade. To celebrate this event her mother bought her a multiplication table M with n rows and n columns such that M_{ij}=a_i ⋅ a_j where a_1, ..., a_n is some sequence of positive integers.

Of course, the girl decided to take it to school with her. But while she was having lunch, hooligan Grisha erased numbers on the main diagonal and threw away the array a_1, ..., a_n. Help Sasha restore the array!

Input

The first line contains a single integer n (3 ⩽ n ⩽ 10^3), the size of the table. 

The next n lines contain n integers each. The j-th number of the i-th line contains the number M_{ij} (1 ≤ M_{ij} ≤ 10^9). The table has zeroes on the main diagonal, that is, M_{ii}=0.

Output

In a single line print n integers, the original array a_1, ..., a_n (1 ≤ a_i ≤ 10^9). It is guaranteed that an answer exists. If there are multiple answers, print any.

Examples

Input


5
0 4 6 2 4
4 0 6 2 4
6 6 0 3 6
2 2 3 0 2
4 4 6 2 0


Output


2 2 3 1 2 

Input


3
0 99990000 99970002
99990000 0 99980000
99970002 99980000 0


Output


9999 10000 9998 
import java.util.*;
import java.io.*;
import java.math.*;
public class Main{
	static int mod = (int)1e9+7;
	public static PrintWriter out = new PrintWriter (new BufferedOutputStream(System.out));
	public static void main(String sp[])throws IOException{
		FastReader sc = new FastReader();
		int n =  sc.nextInt();
		long arr[][] = new long[n][n];
		for(int i=0;i<n;i++){
			for(int j=0;j<n;j++){
				arr[i][j]=sc.nextLong();
			}
		}
		long store[] = new long[n];
		long a = arr[0][2]*arr[1][2];
		store[2]=(long)Math.sqrt(a/arr[0][1]);
		store[1]=arr[1][2]/store[2];
		store[0]=arr[0][1]/store[1];
		
		for(int i=3;i<n;i++){
			store[i]=arr[i][0]/store[0];
		}
		for(int i=0;i<n;i++)
			System.out.print(store[i]+" ");
		System.out.println();
		
	}
	static trie head = new trie();
	public static void add(String st){
		head.ch=' ';
		trie temp=head;
		trie prev=head;
		for(int i=0;i<st.length();i++){
			char val = st.charAt(i);
			if(i==st.length()-1){
			}
			if(!temp.hm.containsKey(val)){
				trie tg = new trie();
				
				temp.ch=val;
				temp.hm.put(val,tg);
				temp.hm.get(val).count+=1;
				prev=temp;
				temp=tg;
			}else{
				prev=temp;
				temp.hm.get(val).count+=1;
				temp = temp.hm.get(val);
			}
			
		}
	}
	
	public static int find(String st){
		int count=Integer.MAX_VALUE;
		trie trv = head;
		boolean b=true;
		for(int i=0;i<st.length();i++){
			if(trv.hm.containsKey(st.charAt(i))){
				count=Math.min(count,trv.hm.get(st.charAt(i)).count);
				trv=trv.hm.get(st.charAt(i));
			}else{
				count=0;
				break;
			}
		}
		return count;
	}
	
	public static class trie{
		char ch;
		HashMap<Character,trie> hm = new HashMap<>();
		int count;
		boolean isterminal;
	}
	
	
	
	
	public static class pair{
		long val;
		int key;
	}
	
	public static class comp implements Comparator<pair>{
		public int compare(pair o1, pair o2){
			return Long.valueOf(o2.val).compareTo(Long.valueOf(o1.val));
		}
		
	}
	
	
	public static int partition(int [] arr, int s, int e){
		
		int index=s;
		int pivot = arr[e];
		for(int i=s;i<=e-1;i++){
			if(arr[i]<=pivot){
				arr = swap(arr, index, i);
				index++;
			}
		}
		swap(arr,index,e);
		print(arr);
		return index;
	}
	
	public static int[] swap(int[] arr, int low, int high){
		int temp = arr[low];
		arr[low]=arr[high];
		arr[high]=temp;
		return arr;
	}
	
	
	public static long gcd(long a, long b){
		if(a==0)
			return b;
		
		return gcd(b%a,a);
	}
	
	public static void print(int[] arr){
		for(int i=0;i<arr.length;i++)
			System.out.print(arr[i]+" ");
		System.out.println();
	}
	
 
	public static class FastReader {
		BufferedReader br;
		StringTokenizer st;
	
 
		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}
 
		String next() {
			while (st == null || !st.hasMoreTokens()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (Exception r) {
					r.printStackTrace();
				}
			}
			return st.nextToken();
		}
 
		int nextInt() {
			return Integer.parseInt(next());//converts string to integer
		}
 
		double nextDouble() {
			return Double.parseDouble(next());
		}
 
		long nextLong() {
			return Long.parseLong(next());
		}
 
		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (Exception r) {
				r.printStackTrace();
			}
			return str;
		}
	}
	
}