whatalnk

class Cdgame():
  def rescount(self, a, b):
    sum_a = sum(a)
    sum_b = sum(b)
    res = []
    for i in a:
        for j in b:
            res.append((sum_a-i+j)*(sum_b-j+i))
    return(len(set(res)))

whatalnk

s = gets.chomp.split(" ")
res = []
s.each do |i|
  case i
  when "Left" then res << "<"
  when "Right" then res << ">"
  when "AtCoder" then res << "A"
  end
end
puts res.join(" ")

whatalnk

# ALDS1_1_D Maximum Profit
n = gets.chomp.to_i
r = []
n.times do
  r << gets.chomp.to_i
end
maxv = r[1] - r[0]
minv = r[0]
(1..n-1).each do |i|
  maxv = [maxv, r[i] - minv].max

whatalnk

# ALDS1_1_A Insertion Sort
n = gets.chomp.to_i
a = gets.chomp.split(" ").map(&:to_i)
def insertionSort(a, n)
  puts a.join(" ")
  (1..n-1).each do |i|
    v = a[i]
    j = i - 1
    while j >= 0 and a[j] > v
      a[j+1] = a[j]

whatalnk

# SRM #645 Div2 Easy
class BacteriesColony():
    def performTheExperiment(self, c):
        while True:
            diff = [0] * len(c)
            for i in range(1, len(c)-1):
                if c[i] > c[i-1] and c[i] > c[i+1]:
                    diff[i] = -1
                elif c[i] < c[i-1] and c[i] < c[i+1]:
                    diff[i] = 1

whatalnk

# SRM 646 Div2 Easy
class TheConsecutiveIntegersDivTwo():
    def find(self, numbers, k):
        if k == 1:
            return 0
        else:
            n_sorted = sorted(numbers)
            n_diff = [n_sorted[i+1] - n_sorted[i] for i in range(len(numbers)-1)]
            return min(n_diff) - 1

whatalnk

# SRM 647 Div2 Easy
# http://community.topcoder.com/stat?c=problem_statement&pm=13632

class PeacefulLine():
    def makeLine(self, x):
        d = {}
        for i in x:
            if i in d.keys():
                d[i] += 1
            else:

whatalnk

# SRM 648 Div2 Easy
#http://community.topcoder.com/stat?c=problem_statement&pm=13650
class KitayutaMart2():
    def numBought(self, k, t):
        n = 1
        ksum = k
        while True:
            if ksum == t:
                return n
            n += 1

whatalnk

# SRM 671 Div2 Easy
# [Very short Editorial of SRM #671 - Codeforces](http://codeforces.com/blog/entry/20939)
class BearPaints():
    def maxArea(self, w, h, m):
        area = 1
        for i in range(1,w+1):
            area = max(area, i * min(m/i, h))
        return area

whatalnk

# SRM 672 Div2 Easy
class SetPartialOrder():
    def compareSets(self, a, b):
        seta = set(a)
        setb = set(b)
        if seta == setb:
            return "EQUAL"
        elif seta.issubset(setb):
            return "LESS"
        elif setb.issubset(seta):