
# slower version:

s = input()
for i in range(len(s)):
  if i%2 == 0:
    print(s[i], end = '')


# optimized version of the same code:

s = input()
ans = ''
for i in range(len(s)):
  if i % 2 == 0:
    ans += s[i]
print(ans)



# slower version:

from math import gcd



N = int(eval(input()))

num_lis = list(map(int, input().split()))

c = True



def osa_k(max_num):

  lis = [i for i in range(max_num+1)]

  p = 2

  while p**2 <= max_num:

    if lis[p] == p:

      for q in range(2*p, max_num+1, p):

        if lis[q] == q:

          lis[q] = p

    p += 1

  return lis



hoge = 0

for i in num_lis:

  hoge = gcd(hoge, i)

if hoge > 1:

  print("not coprime")

  exit()



d_lis = osa_k(10**6+10)

tmp = set()

for i in num_lis:

  num = i

  new_tmp = set()

  while num > 1:

    d = d_lis[num]

    new_tmp.add(d)

    num //= d

  for j in new_tmp:

    if j in tmp:

      c = False

      break

    else:

      tmp.add(j)

  else:

    continue

  break



if c:

  print("pairwise coprime")

else:

  print("setwise coprime")

# optimized version of the same code:

from math import gcd



N = int(eval(input()))

num_lis = list(map(int, input().split()))



def osa_k(max_num):

  lis = [i for i in range(max_num+1)]

  p = 2

  while p**2 <= max_num:

    if lis[p] == p:

      for q in range(2*p, max_num+1, p):

        if lis[q] == q:

          lis[q] = p

    p += 1

  return lis



hoge = 0

for i in num_lis:

  hoge = gcd(hoge, i)

if hoge > 1:

  print("not coprime")

  exit()



d_lis = osa_k(max(num_lis))

tmp = set()

for i in num_lis:

  num = i

  new_tmp = set()

  while num > 1:

    d = d_lis[num]

    new_tmp.add(d)

    num //= d

  for j in new_tmp:

    if j in tmp:

      print("setwise coprime")

      exit()

    else:

      tmp.add(j)

print("pairwise coprime")
from math import gcd

N = int(eval(input()))
num_lis = list(map(int, input().split()))
c = True


def osa_k(max_num):
    lis = [i for i in range(max_num + 1)]
    p = 2
    while p**2 <= max_num:
        if lis[p] == p:
            for q in range(2 * p, max_num + 1, p):
                if lis[q] == q:
                    lis[q] = p
        p += 1
    return lis


hoge = 0
for i in num_lis:
    hoge = gcd(hoge, i)
if hoge > 1:
    print("not coprime")
    exit()
d_lis = osa_k(10**6 + 10)
tmp = set()
for i in num_lis:
    num = i
    new_tmp = set()
    while num > 1:
        d = d_lis[num]
        new_tmp.add(d)
        num //= d
    for j in new_tmp:
        if j in tmp:
            c = False
            break
        else:
            tmp.add(j)
    else:
        continue
    break
if c:
    print("pairwise coprime")
else:
    print("setwise coprime")

from math import gcd

N = int(eval(input()))
num_lis = list(map(int, input().split()))


def osa_k(max_num):
    lis = [i for i in range(max_num + 1)]
    p = 2
    while p**2 <= max_num:
        if lis[p] == p:
            for q in range(2 * p, max_num + 1, p):
                if lis[q] == q:
                    lis[q] = p
        p += 1
    return lis


hoge = 0
for i in num_lis:
    hoge = gcd(hoge, i)
if hoge > 1:
    print("not coprime")
    exit()
d_lis = osa_k(max(num_lis))
tmp = set()
for i in num_lis:
    num = i
    new_tmp = set()
    while num > 1:
        d = d_lis[num]
        new_tmp.add(d)
        num //= d
    for j in new_tmp:
        if j in tmp:
            print("setwise coprime")
            exit()
        else:
            tmp.add(j)
print("pairwise coprime")

-c = True -d_lis = osa_k(10**6 + 10) +d_lis = osa_k(max(num_lis)) -            c = False -            break +            print("setwise coprime") +            exit() -    else: -        continue -    break -if c: -    print("pairwise coprime") -else: -    print("setwise coprime") +print("pairwise coprime")