=====Problem Statement=====
Given a list of rational numbers,find their product.

Concept
The reduce() function applies a function of two arguments cumulatively on a list of objects in succession from left to right to reduce it to one value. Say you have a list, say [1,2,3] and you have to find its sum.

>>> reduce(lambda x, y : x + y,[1,2,3])
6

You can also define an initial value. If it is specified, the function will assume initial value as the value given, and then reduce. It is equivalent to adding the initial value at the beginning of the list. For example:

>>> reduce(lambda x, y : x + y, [1,2,3], -3)
3

>>> from fractions import gcd
>>> reduce(gcd, [2,4,8], 3)
1

=====Input Format=====
First line contains n, the number of rational numbers.
The ith of next n lines contain two integers each, the numerator (N_i) and denominator (D_i) of the ith rational number in the list.

=====Constraints=====
1≤n≤100
1≤N_i,D_i≤10^9

=====Output Format=====
Print only one line containing the numerator and denominator of the product of the numbers in the list in its simplest form, i.e. numerator and denominator have no common divisor other than 1.

Difficulty: introductory

Starter code:

from fractions import Fraction
from functools import reduce

def product(fracs):
    t = # complete this line with a reduce statement
    return t.numerator, t.denominator

if __name__ == '__main__':
    fracs = []
    for _ in range(int(input())):
        fracs.append(Fraction(*map(int, input().split())))
    result = product(fracs)
    print(*result)

Solutions:
from fractions import Fraction
from functools import reduce
def product(fracs):
    t = Fraction(reduce(lambda x,y : x*y,fracs))
    return t.numerator, t.denominator
def __starting_point():
    fracs = []
    for _ in range(int(input())):
        fracs.append(Fraction(*list(map(int, input().split()))))
    result = product(fracs)
    print((*result))

'''
3
1 2
3 4
10 6
'''

__starting_point()