황소개발자

포비아포비아! n = int(input()) lst = input() ans = 999999999 def go(idx, cost): global ans if idx == n - 1: ans = min(ans, cost) return now = lst[idx] if now == 'B': for i in range(idx + 1, n): if lst[i] == 'O': go(i, cost + pow(i - idx, 2)) elif now == 'O': for i in range(idx + 1, n): if lst[i] == 'J': go(i, cost + pow(i - idx, 2)) elif now == 'J': for i in range(idx + 1, n): if lst[i] == 'B': go(i, ..