import sys

input = sys.stdin.readline

N = int(input())
sequence = list(map(int, input().split()))
compare = list(map(int, input().split()))

# 순방향
first_idx = compare.index(sequence[0])  # 기준점
new_list1 = compare[first_idx:] + compare[:first_idx]

# 역방향
compare = compare[::-1]
first_idx = compare.index(sequence[0])  # 기준점
new_list2 = compare[first_idx:] + compare[:first_idx]

# 둘 중 하나 맞으면 good puzzle
if sequence == new_list1 or sequence == new_list2:
    print("good puzzle")
else:
    print("bad puzzle")

import sys

input = sys.stdin.readline

N = int(input())
sequence = list(map(int, input().split()))
compare = list(map(int, input().split()))

new_list1 = []
new_list2 = []

first_idx = compare.index(sequence[0])  # 기준점

# 순방향인 경우
start = first_idx - N
end = first_idx

for i in range(start, end):
    new_list1.append(compare[i])

# 역방향인 경우
start = first_idx
end = first_idx - N

for i in range(start, end, -1):
    new_list2.append(compare[i])

# 둘 중 하나 맞으면 good puzzle
if sequence == new_list1 or sequence == new_list2:
    print("good puzzle")
else:
    print("bad puzzle")

'''
5
1 2 3 4 5
3 4 5 1 2

6
1 2 3 4 5 6
3 2 1 6 5 4
4 5 6 1 2 3

11
11 10 9 8 7 6 5 4 3 2 1
1 2 3 4 5 6 7 8 9 10 11

'''

import sys
from collections import deque

input = sys.stdin.readline

N = int(input())
board = [[0] * (N) for _ in range(N)]  # NxN 보드 생성

K = int(input())  # 사과 개수
for _ in range(K):  # 사과 위치 지정 0:없음, 1:있음
    y, x = map(int, input().split())
    board[y - 1][x - 1] = 2

# 우, 하, 좌, 상 // 시계방향
dx = [1, 0, -1, 0]
dy = [0, 1, 0, -1]

L = int(input())  # 방향 전환 횟수
times = deque()
directions = deque()
for _ in range(L):
    time, dire = input().rstrip().split()
    times.append(int(time))
    directions.append(dire)

count = 0
direction = 0
nx, ny = 0, 0  # 초기위치
visited = deque([[ny, nx]])

while True:
    count += 1
    # 칸 이동
    nx += dx[direction]
    ny += dy[direction]
    if 0 <= nx < N and 0 <= ny < N and board[ny][nx] != 1:  # 보드 체크
        # 사과가 있으면 그냥 추가, 없으면 꼬리 제거하고 추가
        if board[ny][nx] == 0:  # 사과가 없으면
            temp_y, temp_x = visited.popleft()
            board[temp_y][temp_x] = 0  # 꼬리 줄어듬
        board[ny][nx] = 1
        visited.append([ny, nx])

    else:
        print(count)
        exit(0)

    if count in times:
        dire = directions.popleft()
        if dire == 'D':
            direction += 1
            if direction > 3:
                direction = 0
        else:
            direction -= 1
            if direction < 0:
                direction = 3

import sys
from collections import deque

input = sys.stdin.readline
N, M = map(int, input().split())
pick_list = list(map(int, input().split()))
count = 0

num_list = deque([x for x in range(1, N + 1)])

for i in range(M):
    num_len = len(num_list)
    num_index = num_list.index(pick_list[i])

    if num_index < num_len - num_index:  # 왼쪽에 가까우면
        while True:
            if num_list[0] == pick_list[i]:
                num_list.popleft()
                break
            else:
                num_list.rotate(-1)
                count += 1
    else:  # 오른쪽에 가까우면
        while True:
            if num_list[0] == pick_list[i]:
                num_list.popleft()
                break
            else:
                num_list.rotate(1)
                count += 1

print(count)

import sys
from collections import deque

T = int(input())

for _ in range(T):
    comm = input()
    N = int(sys.stdin.readline())

    temp = input()[1:-1]
    if ',' not in temp and temp != "":
        num_list = deque([int(temp)])
    elif temp != "":
        num_list = deque(map(int, temp.split(',')))
    else:
        num_list = deque()

    flag = True
    cnt = 0  # Reverse의 개수

    for i in range(len(comm)):
        if comm[i] == "R":
            cnt += 1
        else:
            if len(num_list) == 0:
                flag = 0
                break

            if cnt % 2 == 0:
                num_list.popleft()
            else:
                num_list.pop()

    if cnt % 2 == 1:
        num_list.reverse()

    if flag:
        print("[", end="")
        for i in range(len(num_list)):
            if i == len(num_list) - 1:
                print(num_list[i], end="")
            else:
                print(str(num_list[i]) + ",", end="")
        print("]")
    else:
        print('error')

import sys

input = sys.stdin.readline

T = int(input())

for _ in range(T):
    N, M = map(int, input().split())
    priority_list = list(map(int, input().split()))
    docs_list = list(range(len(priority_list)))
    docs_list[M] = 'target'

    order = 0

    while True:
        num = priority_list[0]
        if num == max(priority_list):
            order += 1

            if docs_list[0] == 'target':
                print(order)
                break
            else:
                priority_list.pop(0)
                docs_list.pop(0)
        else:
            priority_list.append(priority_list.pop(0))
            docs_list.append(docs_list.pop(0))

import sys
from collections import deque

input = sys.stdin.readline

N = int(input())
queue = deque([])

for _ in range(N):
    comm = input().split()

    if comm[0] == 'push_front':
        queue.appendleft(comm[1])
    elif comm[0] == 'push_back':
        queue.append(comm[1])
    elif comm[0] == 'pop_front':
        if not queue:
            print(-1)
        else:
            print(queue.popleft())
    elif comm[0] == 'pop_back':
        if not queue:
            print(-1)
        else:
            print(queue.pop())
    elif comm[0] == 'size':
        print(len(queue))
    elif comm[0] == 'empty':
        if not queue:
            print(1)
        else:
            print(0)
    elif comm[0] == 'front':
        if not queue:
            print(-1)
        else:
            print(queue[0])
    elif comm[0] == 'back':
        if not queue:
            print(-1)
        else:
            print(queue[-1])