#!/usr/bin/env python3
import sys
from functools import reduce

def readTimeStamp():
    time = int(sys.stdin.readline())
    return sys.stdin.readline().split(',')

### https://rosettacode.org/wiki/Chinese_remainder_theorem#Python_3.6
def chinese_remainder(n, a):
    sum = 0
    prod = reduce(lambda a, b: a*b, n)
    for n_i, a_i in zip(n, a):
        p = prod // n_i
        sum += a_i * mul_inv(p, n_i) * p
    return sum % prod
 
def mul_inv(a, b):
    b0 = b
    x0, x1 = 0, 1
    if b == 1: return 1
    while a > 1:
        q = a // b
        a, b = b, a%b
        x0, x1 = x1 - q * x0, x0
    if x1 < 0: x1 += b0
    return x1
###

def convertStamp(stamp):
    n = []
    a = []

    for index, ID in enumerate(stamp):
        if ID == 'x':
            continue
        
        val = int(ID)

        if index == 0:
            a.append(index)
        else:
            a.append(val - index)
            
        n.append(val)

    return n, a

def earliestTime(stamp):
    n,a = convertStamp(stamp)
    print(n,a)
    return chinese_remainder(n,a)

def main():
    stamp = readTimeStamp()
    time = earliestTime(stamp)
    print(time)

if __name__ == "__main__":
    main()