Problem:
 Score : 100 points    Problem Statement You are given two integers a and b .
Determine if a+b=15 or a\times b=15 or neither holds.  Note that a+b=15 and a\times b=15 do not hold at the same time.      Constraints  1 \leq a,b \leq 15  All values in input are integers.         Input Input is given from Standard Input in the following format:  a  b       Output If a+b=15 , print + ;
if a\times b=15 , print * ;
if neither holds, print x .        Sample Input 1 4 11      Sample Output 1 +  4+11=15 .       Sample Input 2 3 5      Sample Output 2 *  3\times 5=15 .       Sample Input 3 1 1      Sample Output 3 x  1+1=2 and 1\times 1=1 , neither of which is 15 .

Solution (Python):
a, b = map(int, input().split())
if a + b == 15:
  print("+")
elif a * b == 15:
  print("*")
else:
  print("x")

Solution (Python):
a,b = (int(T) for T in input().split())
print(['x',['*','+'][a+b==15]][(a*b==15)or(a+b==15)])

Solution (Python):
a,b = (int(T) for T in input().split())
if a+b==15:
    print('+')
elif a*b==15:
    print('*')
else:
    print('x')

Solution (Python):
a,b = map(int,input().split())
if a+b==15:
  print('+')
elif a*b==15:
  print('*')
else:
  print('x')

Solution (Python):
a,b = map(int,input().split())
if a + b == 15:
    print("+")
elif a * b == 15:
    print("*")
else:
    print("x")

Solution (Python):
a,b=map(int,input().split())

if a+b==15:
  print("+")
elif a*b==15:
  print("*")
else:
  print("x")

Solution (Python):
a, b = map(int,input().split())
if a + b == 15:
  print("+")
elif a * b == 15:
  print("*")
else:
  print("x")

Solution (Python):
a, b = map(int, input().split())
if a + b == 15:
  print("+")
elif a * b == 15:
  print("*")
else:
  print("x")

Solution (Python):
a, b = map(int,input().split())
if a + b == 15:
    print('+')
elif a * b == 15:
    print('*')
else:
    print('x')

Solution (Python):
a,b = map(int,input().split())
if a+b == 15:
  print("+")
elif a*b == 15:
  print("*")
else:
  print("x")

Solution (Python):
a, b = map(int,input().split())
if 15-a == b:
  print("+")
elif 15/a == b:
  print("*")
else:
  print("x")

Solution (Python):
a,b=map(int,input().split())

if a+b==15:
    print("+")
elif a*b==15:
    print("*")
else:
    print("x")

Solution (Python):
a,b=map(int,input().split())
if a*b==15:
  print("*")
elif a+b==15:
  print("+")
else:
  print("x")

Solution (Python):
a,b = map(int,input().split())
if a + b == 15:
    print("+")
elif a * b == 15:
    print("*")
else:
    print("x")

Solution (Python):
a,b = map(int, input().split())
if a+b == 15:
    print('+')
elif a*b == 15:
    print('*')
else:
    print('x')

Solution (Python):
a,b = map(int,input().split())
if(a+b==15):
  print("+")
elif(a*b==15):
  print("*")
else:
  print("x")

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil,pi,factorial
    from operator import itemgetter
    def I(): return int(input())
    def MI(): return map(int, input().split())
    def LI(): return list(map(int, input().split()))
    def LI2(): return [int(input()) for i in range(n)]
    def MXI(): return [[LI()]for i in range(n)]
    def SI(): return input().rstrip()
    def printns(x): print('\n'.join(x))
    def printni(x): print('\n'.join(list(map(str,x))))
    inf = 10**17
    mod = 10**9 + 7

    a,b=MI()
    if a+b==15:
        print("+")
    elif a*b==15:
        print("*")
    else:
        print("x")
    

        
        
        
        
    
if __name__=="__main__":
    main()

Solution (Python):
a, b = map(int, input().split())
if a + b == 15:
    print("+")
elif a * b == 15:
    print("*")
else:
    print("x")

Solution (Python):
a,b=map(int,input().split())
if a+b==15:
  print('+')
elif a*b==15:
  print('*')
else:
  print('x')

Solution (Python):
a,b=map(int,input().split())
if a+b==15:
    print('+')
elif a*b==15:
    print('*')
else:
    print('x')

Solution (Python):
a,b=map(int,input().split())
if a+b == 15:
  print('+')
elif a*b==15:
  print('*')
else:
  print('x')

Solution (Python):

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


def solve():
    A, B = map(int, input().split())
    if A + B == 15:
        print("+")
    elif A * B == 15:
        print("*")
    else:
        print("x")


def main():
    solve()


if __name__ == '__main__':
    main()

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    a, b = map(int, readline().split())

    if a + b == 15:
        print("+")
    elif a * b == 15:
        print("*")
    else:
        print("x")


if __name__ == '__main__':
    main()

Solution (Python):

import sys
def input():
    return sys.stdin.readline()[:-1]

def main():
    a, b = map(int, input().split())

    if a + b == 15:
        print('+')
    elif a * b == 15:
        print('*')
    else:
        print('x')

if __name__ == '__main__':
    main()

Solution (Python):
a,b=map(int,input().split())
if a+b == 15:
    print('+')
elif a*b == 15:
    print('*')
else:
    print('x')

Solution (Python):
import sys, math
from functools import lru_cache
import numpy as np
import heapq
from collections import defaultdict
sys.setrecursionlimit(10**9)
MOD = 10**9+7

def input():
    return sys.stdin.readline()[:-1]

def mi():
    return map(int, input().split())

def ii():
    return int(input())

def i2(n):
    tmp = [list(mi()) for i in range(n)]
    return [list(i) for i in zip(*tmp)]


def main():
    a, b = mi()
    if a+b == 15:
        print('+')
    elif a*b == 15:
        print('*')
    else:
        print('x')



if __name__ == '__main__':
    main()

Solution (Python):
a,b=map(int,input().split())
if a+b==15:
    ans='+'
elif a*b==15:
    ans='*'
else:
    ans='x'
print(ans)

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
a, b = M()
ans = 'x'
if a+b == 15:
    ans = '+'
elif a*b == 15:
    ans = '*'
print(ans)

Solution (Python):
a,b = map (int, input ().split ())
if a+b == 15:
  print ('+')
elif a*b == 15:
  print ('*')
else:
  print ('x')

Solution (Python):
a, b = map(int, input().split())
print("+") if a+b==15 else print("*") if a*b==15 else print("x")

Solution (Python):
a,b=map(int,input().split())
print("+" if a+b==15 else "*" if a*b==15 else "x")

Solution (Python):
a, b = map(int, input().split())
if a+b==15:
    print('+')
elif a*b==15:
    print('*')
else:
    print('x')

Solution (Python):
a, b = map(int, input().split())
if a + b == 15:
    print("+")
elif a * b == 15:
    print("*")
else:
    print("x")

Solution (Python):
a,b = map(int, input().split())
if a+b == 15:
  print("+")
elif a*b == 15:
  print("*")
else:
  print('x')

Solution (Python):
a,b = map(int, input().split())
if a+b == 15:
  print('+')
elif a*b == 15:
  print('*')
else:
  print('x')

Solution (Python):
a, b = map(int, input().split())
if a + b == 15:
  print("+")
elif a * b == 15:
  print("*")
else:
  print("x")

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rf = lambda: map(float, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

a, b = rm()
if a+b == 15:
    print('+')
elif a*b == 15:
    print('*')
else:
    print('x')

Solution (Python):
a, b = map(int, input().split())
if a+b==15:
    print("+")
elif a*b==15:
    print("*")
else:
    print("x")

Solution (Python):
a,b=map(int,input().split())
if a+b==15:
    print("+")
elif a*b==15:
    print("*")
else:
    print("x")

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    a, b = LI()

    if a + b  == 15:
        print('+')
    elif a * b == 15:
        print('*')
    else:
        print('x')

if __name__ == '__main__':
    resolve()

Solution (Python):
a, b = map(int, input().split())
if a + b == 15:
  print("+")
elif a * b == 15:
  print("*")
else:
  print("x")

Solution (Python):
a, b = map(int, input().split())
if a * b == 15:
  print("*")
elif a + b == 15:
  print("+")
else:
  print("x")

Solution (Python):
A, B = map(int, input().split())
if A + B == 15:
    print('+')
elif A * B == 15:
    print('*')
else:
    print('x')

Solution (Python):
a, b = map(int, input().split())
if a + b == 15:
    print('+')
elif a * b == 15:
    print('*')
else:
    print('x')

Solution (Python):
a, b = map(int, input().split())

if a + b == 15:
    ans = "+"
elif a*b == 15:
    ans = "*"
else:
    ans = "x"

print(ans)

Solution (Python):
a, b = map(int, input().split())
if (a+b) == 15:
    print('+')
elif (a*b) == 15:
    print('*')
else:
    print('x')

Solution (Python):
a,b=map(int,input().split())
if a+b==15:
  print('+')
elif a*b==15:
  print('*')
else:
  print('x')

Solution (Python):
a,b = map(int, input().split())

if a + b == 15:
    print('+')
elif a * b == 15:
    print('*')
else:
    print('x')

Solution (Python):
a,b=map(int,input().split())
if a+b==15:
    print('+')
elif a*b==15:
    print('*')
else:
    print('x')

Solution (Python):
a, b = map(int, input().split())
if a+b == 15:
  print ('+')
elif a*b == 15:
  print ('*')
else:
  print ('x')

Solution (Python):
a,b = map(int, input().split())
print('+' if a+b==15 else '*' if a*b==15 else 'x')

Solution (Python):
a, b = map(int, input().split())
if a + b == 15:
  print("+")
elif a * b == 15:
  print("*")
else:
  print("x")

Solution (Python):
a,b=map(int,input().split())
if a+b==15:
  print("+")
elif a*b==15:
  print("*")
else:
  print("x")

Solution (Python):


a, b = map(int,input().split())
if a*b == 15:
    print("*")
elif a+b==15:
    print("+")
else:
    print("x")

Solution (Python):
a, b = [int(i) for i in input().split()]

if a + b == 15:
  print("+")
  exit(0)
if a * b == 15:
  print("*")
  exit(0)
print("x")

Solution (Python):
a,b=map(int,input().split())

if a+b==15:
  print("+")
elif a*b==15:
  print("*")
else:
  print("x")

Solution (Python):
a,b=map(int,input().split())
c="x"
if a+b==15:c="+"
if a*b==15:c="*"
print(c)

Solution (Python):
a,b = map(int,input().split())
if a+b ==  15:
    print("+")
elif a*b == 15:
    print("*")
else:
    print("x")

Solution (Python):
a, b = map(int, input().split())
if a + b == 15:
    ans = '+'
elif a * b == 15:
    ans = '*'
else:
    ans = 'x'
print(ans)

Solution (Python):
a,b = map(int,input().split())
if a+b == 15:
	print('+')
elif a*b == 15:
	print('*')
else:
	print('x')

Solution (Python):
a, b = map(int, input().split())
if a * b == 15:
  print("*")
elif a + b == 15:
  print("+")
else:
  print("x")

Solution (Python):


import sys
from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union































def main():
    Num = Union[int, float]
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input():  return sys.stdin.readline().rstrip()
    def ii():     return int(input())
    def isp():    return input().split()
    def mi():     return map(int, input().split())
    def mi_0():   return map(lambda x: int(x)-1, input().split())
    def lmi():    return list(map(int, input().split()))
    def lmi_0():  return list(map(lambda x: int(x)-1, input().split()))
    def li():     return list(input())
    def debug(x): print(x, file=sys.stderr)
    
    
    
    a, b = mi()
    if a + b == 15:
        print('+')
    elif a * b == 15:
        print('*')
    else:
        print('x')


if __name__ == "__main__":
    main()

Solution (Python):
a, b = map(int, input().split())
if a + b == 15:
    print('+')
elif a * b == 15:
    print('*')
else:
    print('x')

Solution (Python):
a,b=map(int,input().split())
print("+" if a+b==15 else "*" if a*b==15 else "x")

Solution (Python):
a,b=map(int,input().split())
if a+b==15:
  print("+")
elif a*b==15:
  print("*")
else:
  print("x")

Solution (Python):
a,b = map(int,input().split())
if a+b == 15:
  print("+")
elif a*b==15:
  print("*")
else:
  print("x")

Solution (Python):
a, b = map(int, input().split())
if a + b == 15:
    print('+')
elif a * b == 15:
    print('*')
else:
    print('x')

Solution (Python):
a,b=map(int,input().split())
if a+b==15:
    print('+')
elif a*b==15:
    print('*')
else:
    print('x')

Solution (Python):
a, b = map(int, input().split())
if a+b == 15:
    print('+')
elif a*b == 15:
    print('*')
else:
    print('x')

Solution (Python):
a, b = map(int, input().split())
if a+b == 15:
    print('+')
elif a*b == 15:
    print('*')
else:
    print('x')

Solution (Python):
a,b=map(int,input().split())
if a + b == 15:
  print('+')
elif a * b == 15:
  print('*')
else:
  print('x')

Solution (Python):
a,b=map(int,input().split())
if a+b==15:
  print("+")
elif a*b==15:
  print("*")
else:
  print("x")

Solution (Python):
A,B=map(int,input().split())
if A+B==15:
    print('+')
elif A*B==15:
    print('*')
else:
    print('x')

Solution (Python):
a, b = map(int, input().split())

if(a + b == 15):
  print("+")
elif(a * b == 15):
  print("*")
else:
  print("x")

Solution (Python):
import sys
input = sys.stdin.readline

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    a,b=MI()
    if a+b==15:
        print("+")
    elif a*b==15:
        print("*")
    else:
        print("x")

main()

Solution (Python):
def main():
    a, b = list(map(int, input().split()))
    if a + b == 15:
        print('+')
    elif a * b == 15:
        print('*')
    else:
        print('x')
if __name__ == '__main__':
    main()

Solution (Python):
a, b = map(int, input().split())
if a + b == 15:
  print('+')
elif a * b == 15:
  print('*')
else:
  print('x')

Solution (Python):
a,b=map(int, input().split())
if a+b==15:
  print("+")
elif a*b==15:
  print("*")
else:
  print("x")

Solution (Python):
a, b = map(int, input().split())
if a+b == 15:
	print('+')
elif a*b == 15:
	print("*")
else:
	print('x')

Solution (Python):
a,b=map(int,input().split());print("+" if a+b==15 else "*" if a*b==15 else "x")

Solution (Python):






import sys
input = sys.stdin.readline

import math

import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache





MOD = 10**9+7
INF = float('inf')
AZ = "abcdefghijklmnopqrstuvwxyz"






def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]


def P(arg): print(arg); return
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def PE(arg): print(arg); exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()


def DD(arg): return defaultdict(arg)


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n): return kaijo_memo[n]
  if(len(kaijo_memo) == 0): kaijo_memo.append(1)
  while(len(kaijo_memo) <= n): kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n): return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0): gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n): gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if n == r: return 1
  if n < r or r < 0: return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1: arr.append([temp, 1])
  if arr==[]: arr.append([n, 1])
  return arr


def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors


def make_primes(N):
  max = int(math.sqrt(N))
  seachList = [i for i in range(2,N+1)]
  primeNum = []
  while seachList[0] <= max:
    primeNum.append(seachList[0])
    tmp = seachList[0]
    seachList = [i for i in seachList if i % tmp != 0]
  primeNum.extend(seachList)
  return primeNum


def gcd(a, b):
    while b: a, b = b, a % b
    return a


def lcm(a, b):
    return a * b // gcd (a, b)


def count_bit(n):
  count = 0
  while n:
    n &= n-1
    count += 1
  return count


def base_10_to_n(X, n):
  if X//n: return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))

def base_10_to_n_without_0(X, n):
  X -= 1
  if X//n: return base_10_to_n_without_0(X//n, n)+[X%n]
  return [X%n]


def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count





A,B = IL()
if A+B == 15:
  print("+")
elif A*B == 15:
  print("*")
else:
  print("x")

Solution (Python):
a,b = map(int,input().split())
if a+b == 15:
    print("+")
elif a*b == 15:
    print("*")
else:
    print("x")

Solution (Python):
def resolve():
    a, b = map(int, input().split())
    print("+" if a+b == 15 else "*" if a*b == 15 else "x")
resolve()

Solution (Python):
a,b=map(int,input().split())
if a+b==15:print("+")
elif a*b==15:print("*")
else:print("x")

Solution (Python):
a,b=map(int,input().split())
if a+b==15:
    print("+")
elif a*b==15:
    print("*")
else:
    print("x")

Solution (Python):
a,b=map(int,input().split())
if a+b==15:
    print("+")
elif a*b==15:
    print("*")
else:
    print("x")

Solution (Python):
a,b = list(map(int,input().split()))
if a+b==15:
    print("+")
elif a*b==15:
    print("*")
else:
    print("x")

Solution (Python):
a,b = map(int,input().split())

if a + b == 15:
    print('+')
elif a * b == 15:
    print('*')
else:
    print('x')

Solution (Python):
a, b = map(int, input().split())
if a+b == 15:
  print('+')
elif a*b == 15:
  print('*')
else:
  print('x')

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7

 
a, b = MAP()
if a + b == 15:
	print("+")
elif a * b == 15:
	print("*")
else:
	print("x")

Solution (Python):
x, y = map(int,input().split())

if x*y == 15:
    print("*")
elif x+y == 15:
    print("+")
else:
    print("x")

Solution (Python):
a,b=map(int,input().split())
if a + b == 15:
    print("+")
elif a * b == 15:
    print("*")
else:
    print("x")

Solution (Python):
a,b=map(int,input().split())
if a*b==15:
    print("*")
elif a+b==15:
    print("+")
else:
    print("x")

Solution (Python):
from statistics import median


from fractions import gcd
from itertools import combinations 
from collections import deque
from collections import defaultdict
import bisect










import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
a,b = readInts()
print('+' if a + b == 15 else('*' if a*b == 15 else 'x'))

Solution (Python):
a,b = map(int,input().split())
if a+b == 15:
  print('+')
elif a*b == 15:
  print('*')
else:
  print('x')

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    a, b = map(int, input().split())
    print("+" if a + b == 15 else "*" if a * b == 15 else "x")


if __name__ == '__main__':
    resolve()

Solution (Python):
from sys import stdin
a, b = [int(_) for _ in stdin.readline().rstrip().split()]
ans = ''
if a+b == 15:
    ans = '+'
elif a*b == 15:
    ans = '*'
else:
    ans = 'x'
print(ans)

Solution (Python):
a, b = map(int, input().split())
if a * b == 15: print('*')
elif a + b == 15:print('+')
else: print('x')

Solution (Python):
a,b=map(int,input().split())
if a+b==15:
  print("+")
elif a*b==15:
  print("*")
else:
  print("x")

Solution (Python):
a,b=map(int,input().split())
print("+" if a+b==15 else "*" if a*b==15 else "x")

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    a,b=map(int,input().split())
    if a+b==15:print("+")
    elif a*b==15:print("*")
    else:print("x")

if __name__=='__main__':
    main()

Solution (Python):
a, b = map(int, input().split())
if a + b == 15:
  print('+')
elif a * b == 15:
  print('*')
else:
  print('x')

Solution (Python):
a,b = list(map(int,input().split()))
if a+b == 15:
    print('+')
    exit()
if a*b == 15:
    print('*')
    exit()
print('x')

Solution (Python):
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

a,b = map(int,input().split())
if a + b == 15:
  print("+")
elif a * b == 15:
  print("*")
else:
  print("x")

Solution (Python):
a, b = map(int, input().split())

if a + b == 15:
    print("+")
elif a * b == 15:
    print("*")
else:
    print("x")

Solution (Python):
a,b=map(int,input().split())
if a+b==15:
  print("+")
elif a*b==15:
  print("*")
else:
  print("x")

Solution (Python):
a, b = map(int, input().split())
if a+b == 15:
    print("+")

elif a*b == 15:
    print("*")
else:
    print("x")

Solution (Python):
a,b=map(int,input().split())
if a+b==15:
    print("+")
elif a*b==15:
    print("*")
else:
    print("x")

Solution (Python):
a, b = map(int, input().split())
if a + b == 15:
  print('+')
elif a * b == 15:
  print('*')
else:
  print('x')

Solution (Python):
a,b = map(int,input().split())
if a + b == 15:
  print('+')
elif a * b == 15:
  print('*')
else:
  print('x')

Solution (Python):
a, b = map(int, input().split())

if a + b == 15:
  print('+')
elif a * b == 15:
  print('*')
else:
  print('x')

Solution (Python):
a, b = map(int, input().split())

if a+b == 15:
  print('+')
elif a*b == 15:
  print('*')
else:
  print('x')

Solution (Python):
a,b=map(int,input().split())
if a+b==15:
    print('+')
elif a*b==15:
    print('*')
else:
    print('x')

Solution (Python):
a,b = map(int, input().split())
if a + b == 15:
  print('+')
elif a * b == 15:
  print('*')
else:
  print('x')

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

a, b = map(int, readline().split())
if a + b == 15:
    print('+')
elif a * b == 15:
    print('*')
else:
    print('x')

Solution (Python):
a,b=map(int,input().split())
if(a+b==15):
      print("+")
elif(a*b==15):
      print("*")
else:
      print("x")

Solution (Python):
a, b = map(int, input().split())
if a + b == 15:
    print("+")
elif a * b == 15:
    print("*")
else:
    print("x")

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

    a,b = map(int, input().split())
    if a+b == 15:
        print('+')
    elif a*b == 15:
        print('*')
    else:
        print('x')

if __name__ == '__main__':
    main()

Solution (Python):
a, b = map(int, input().split())

if a + b == 15:
    print("+")
elif a * b == 15:
    print("*")
else:
    print("x")

Solution (Python):
a,b = map(int,input().split())
if a + b == 15:
    print("+")
elif a * b == 15: 
    print("*")
else:
    print("x")

Solution (Python):
a, b = map(int,input().split())
if a + b == 15:
    print('+')
elif a * b == 15:
    print('*')
else :
    print('x')

Solution (Python):
a, b = map(int, input().split())
print("*" if a*b == 15 else "+" if a+b == 15 else "x")

Solution (Python):
a, b = map(int, input().split())

if a+b == 15:
    print('+')
elif a*b == 15:
    print('*')
else:
    print('x')

Solution (Python):
a,b = map(int,input().split())
if a*b == 15:
    print("*")
elif a+b == 15:
    print("+")
else:
    print("x")

Solution (Python):
a, b = map(int, input().split())
if a+b==15: print("+")
elif a*b==15: print("*")
else: print("x")

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    a,b=map(int,input().split())
    if a+b==15:print("+")
    elif a*b==15:print("*")
    else:print("x")

if __name__=='__main__':
    main()

Solution (Python):
a, b = map(int, input().split())
if a + b == 15:
    print("+")
elif a * b == 15:
    print("*")
else:
    print("x")

Solution (Python):
a,b = map(int,input().split())
if a+b == 15:
  print("+")
elif a*b == 15:
  print("*")
else:
  print("x")

Solution (Python):
a,b = map(int, input().split())
if a+b==15:
    print('+')
elif a*b==15:
    print('*')
else:
    print('x')

Solution (Python):
a, b = map(int, input().split())
if a + b == 15:
    print("+")
elif a * b == 15:
    print("*")
else:
    print("x")

Solution (Python):
a, b = map(int, input().split())

if a + b == 15:
  print("+")
elif a * b == 15:
  print("*")
else:
  print("x")

Solution (Python):
a, b = map(int,input().split())
if a + b == 15: print("+")
elif a * b == 15: print("*")
else: print("x")

Solution (Python):
a,b = map(int ,input().split())
if a * b == 15:
    print('*')
elif a + b == 15:
    print('+')
else:
    print('x')

Solution (Python):

a, b = map(int, input().split())
if a + b == 15:
    print('+')
elif a * b == 15:
    print('*')
else:
    print('x')

Solution (Python):
a, b = map(int, input().split())
if a + b == 15:
    print('+')
elif a * b == 15:
    print('*')
else:
    print('x')

Solution (Python):
a,b=map(int, input().split())
if a+b==15:
  print('+')
elif a*b==15:
  print('*')
else:
  print('x')

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = 1e10


def solve():
    a, b = LI()
    if a + b == 15:
        print("+")
        return
    if a * b == 15:
        print("*")
        return
    print("x")
    return



if __name__ == '__main__':
    solve()

Solution (Python):
a,b=map(int,input().split())
if a+b==15:
    print('+')
elif a*b==15:
    print('*')
else:
    print('x')

Solution (Python):

a, b = map(int, input().split())
if a + b == 15:
    print("+")
elif a * b == 15:
    print("*")
else:
    print("x")

Solution (Python):
a,b = map(int,input().split())
if a+b==15:
    print('+')
elif a*b==15:
    print('*')
else:
    print('x')

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

if __name__ == '__main__':
    b, c = map(int, input().split())

    if b+c ==15:
        print("+")
    elif b*c ==15:
        print("*")
    else:
        print("x")

Solution (Python):
a,b=map(int,input().split())
print('+' if a+b==15 else '*' if a*b==15 else 'x')

Solution (Python):
a, b = map(int, input().split())
if (a + b == 15):
    print("+")
elif (a * b == 15):
    print("*")
else:
    print("x")