#!/usr/bin/python
'''
Calculating divisors of a number.
functions:
  get_divisors(number):
  calculates divisors of given number.
  
  is_prime(number):
  if givan number be prime, returns True. else returns False.
  
  get_times(number, sep)
  returns a string that countains two numbers and times of those is equal with given number. those numbers seprated with second argument.
'''
def get_divisors(number):
  if number <= 0:
    raise ValueError('given number must be positive')
  divisors = []
  for divisor in range(2, number):
    remaining = number % divisor
    if remaining == 0:
      divisors.append(divisor)
  return divisors

def is_prime(number):
  divisors = get_divisors(number)
  if len(divisors) == 0:
    return True
  else:
    return False

def get_times(number, sep = 'x'):
  if is_prime(number):
    return ['1' + str(sep) + str(number)]
  divisors = get_divisors(number)
  groups = []
  for divisor in divisors:
    other = number / divisor
    bigger = max(other, divisor)
    smaller = number / bigger
    text = str(smaller) + str(sep) + str(bigger)
    if text in groups:
      break
    groups.append(text)
  return groups

if __name__ == '__main__':
  import sys
  for times in get_times(int(sys.argv[1]), ' times '):
    print times