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 
//package com.company;

//import java.io.BufferedReader;
//import java.io.IOException;
//import java.io.IOException;
//import java.io.InputStreamReader;
//import java.math.BigInteger;
//import java.nio.file.Paths;
import java.util.*;

public class Main {
    public static void main(String[] args) {
        // write your code here
        // BufferedReader s=new BufferedReader(new InputStreamReader(System.in));
        //BufferedReader s=new BufferedReader(new InputStreamReader(System.in));    StringBuilder sb = new StringBuilder();
        Scanner s=new Scanner(System.in);
        //     String[] str=s.readLine().trim().split("\\s+");
     //   Integer n=s.nextInt();
     int n=s.nextInt();
        Long[][] a=new Long[n][n];
     for(int i=0;i<n;i++){
         for(int j=0;j<n;j++){
             a[i][j]=s.nextLong();
         }
     }
        Long[] ans=new Long[n];
     ans[1]=(long)Math.sqrt(a[1][2]*a[0][1]/a[0][2]);
     ans[0]=a[1][0]/ans[1];
     for(int i=2;i<n;i++){
         ans[i]=a[i][0]/ans[0];
     }for(int i=0;i<n;i++)
            System.out.print(ans[i]+" ");
    }

    static int gcd(int a, int b)
    {
        if (a == 0)
            return b;
        return gcd(b % a, a);
    }

    // method to return LCM of two numbers
    static int lcm(int a, int b)
    {
        return (a*b)/gcd(a, b);
    }
    static int[] vis;
    static int count;
    static int[] flag;
    static int another;
    static int connected;static int huf=0;
    static void dfs(int i,LinkedList<Integer> [] adj){
        connected++;
        vis[i]=1;if(flag[i]==1) count++;
        if(adj[i]!=null){
            for(int j:adj[i]){
                if(vis[j]==0){
                    if(flag[i]==0) flag[j]=1; else flag[j]=0;

                    dfs(j,adj);
                } else{
                    if(flag[i]==flag[j]){
                        huf=1;
                    }
                }


            }}else{another++;}//return count;
    }






    static  Boolean isCyclicUtil(int v, Boolean visited[], int parent,LinkedList[] adj)
    {
        // Mark the current node as visited
        visited[v] = true;
        Integer i;

        // Recur for all the vertices adjacent to this vertex
        if(adj[v]!=null){
            Iterator<Integer> it = adj[v].iterator();
            while (it.hasNext())
            {
                i = it.next();

                // If an adjacent is not visited, then recur for that
                // adjacent
                if (!visited[i])
                {
                    if (isCyclicUtil(i, visited, v,adj))
                        return true;
                }

                // If an adjacent is visited and not parent of current
                // vertex, then there is a cycle.
                else if (i != parent)
                    return true;
            }}
        return false;
    }

    // Returns true if the graph contains a cycle, else false.
    static Boolean isCyclic(int V,LinkedList<Integer>[] adj)
    {
        // Mark all the vertices as not visited and not part of
        // recursion stack
        Boolean visited[] = new Boolean[V];
        for (int i = 0; i < V; i++)
            visited[i] = false;

        // Call the recursive helper function to detect cycle in
        // different DFS trees
        for (int u = 0; u < V; u++)
            if (!visited[u]) // Don't recur for u if already visited
                if (isCyclicUtil(u, visited, -1,adj))
                    return true;

        return false;
    }

}

class Student
{
    int rollno;
    int color;

    // Constructor
    public Student(int rollno, int color)
    {
        this.rollno = rollno;

        this.color=color;}
    // Used to print student details in main()
    public String toString()
    {
        return this.rollno + " " ;
    }
}

class Sortbyroll implements Comparator<Student>
{
    // Used for sorting in ascending order of
    // roll number
    public int compare(Student a, Student b)
    {
        return a.color - b.color;
    }
}