Problem:


Score : 100 points

Problem Statement

On the Planet AtCoder, there are four types of bases: A, C, G and T. A bonds with T, and C bonds with G.

You are given a letter b as input, which is A, C, G or T. Write a program that prints the letter representing the base that bonds with the base b.

Constraints

b is one of the letters A, C, G and T.

Input

Input is given from Standard Input in the following format:

b

Output

Print the letter representing the base that bonds with the base b.

Sample Input 1

A

Sample Output 1

T

Sample Input 2

G

Sample Output 2

C



Sample input:
A


Sample output:
T

Submission status: Accepted

Solution code:
b=input()

A="A"
C="C"
G="G"
T="T"

if b == A:
    print("T")
    
elif b==C:
    print("G")
    
elif b==G:
    print("C")
    
elif b==T:
    print("A")

Submission status: Accepted

Solution code:
b = input()
A = 'A'
C = 'C'
G = 'G'
T = 'T'
if b == A:
  print(T)
elif b == C:
  print(G)
elif b == G:
  print(C)
else:
  print(A)

Submission status: Accepted

Solution code:
word = input()

enki = {'A':'T','T':'A','C':'G','G':'C'}
print(enki[word])

Submission status: Accepted

Solution code:
s1 = input()

r1 = ""
if s1 == "A":
    r1 = "T"
elif s1 == "C":
    r1 = "G"
elif s1 == "T":
    r1 = "A"
else:
    r1 = "C"

print(r1)

Submission status: Accepted

Solution code:
b = str(input())

if(b == "A"):
    print("T")
elif(b == "T"):
    print("A")
elif(b == "G"):
    print("C")
elif(b == "C"):
    print("G")

Submission status: Accepted

Solution code:
#A,C,G,Tのうち入力に対応する塩基を出力

b=input()
if b=="A":
	print("T")
elif b=="T":
	print("A")
elif b=="C":
	print("G")
else:
	print("C")

Submission status: Accepted

Solution code:
b = input()
if b == "A":
    print("T")
elif  b =="T":
    print("A")
elif b =="G":
    print("C")
else:
    print("G")

Submission status: Accepted

Solution code:
X = input()

if X == "A":
    print("T")
if X == "T":
    print("A")
if X == "C":
    print("G")
if X == "G":
    print("C")

Submission status: Accepted

Solution code:
print("TGCA"["ACGT".find(input())])

Submission status: Accepted

Solution code:
b=input()
if b=='A':
    print('T')
elif b=='T':
    print('A')
elif b=='G':
    print('C')
elif b=='C':
    print('G')

Submission status: Accepted

Solution code:
b=str(input())
if b=='C': 
    print('G')
elif b=='G':
    print('C')
elif b=='A':
    print('T')
else:
    print('A')

Submission status: Accepted

Solution code:
print("TGCA"["ACGT".find(input())])

Submission status: Accepted

Solution code:
s = input()

if s == 'A':
  print('T')
elif s == 'T':
  print('A')
elif s == 'G':
  print('C')
else:
  print('G')

Submission status: Accepted

Solution code:
b = input()

if b is "A":
    print("T")

if b is "T":
    print("A")

if b is "C":
    print("G")

if b is "G":
    print("C")

Submission status: Accepted

Solution code:
def abc():
    mapping = {
        'A': 'T',
        'C': 'G',
        'G': 'C',
        'T': 'A',
    }
    b = input().rstrip()
    print(mapping[b])


abc()

Submission status: Accepted

Solution code:
b=input()

if(b=="A"):
    print("T")
elif(b=="T"):
    print("A")
elif(b=="G"):
    print("C")
else:
    print("G")

Submission status: Accepted

Solution code:
c = input()
di = {"A":"T","T":"A","G":"C","C":"G"}
print(di[c])

Submission status: Accepted

Solution code:
b = input()
d = {"A": "T", "T": "A", "C": "G", "G": "C"}
print(d[b])

Submission status: Accepted

Solution code:
b = input()
dic = {'A':'T', 'C':'G', 'G':'C', 'T':'A'}
print(dic[b])

Submission status: Accepted

Solution code:
import sys


for line in sys.stdin.readlines():
    line=line.strip()
    if line == 'A':
        print('T')
    if line == 'T':
        print('A')
    if line == 'C':
        print('G')
    if line == 'G':
        print('C')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import sys

input = sys.stdin.readline

def main():
    m = {"A": "T", "T": "A", "G": "C", "C": "G"}
    print(m[input().strip()])

main()

Submission status: Accepted

Solution code:
b = input()
dic = {'A':'T','T':'A','C':'G','G':'C'}
print(dic[b])

Submission status: Accepted

Solution code:
b=input()

if b=="A":
    print("T")
elif b=="C":
    print("G")
elif b=="G":
    print("C")
else:
    print("A")

Submission status: Accepted

Solution code:
import sys

b=input()
if b=='A':
    print('T')
elif b=='T':
    print('A')
elif b=='C':
    print('G')
elif b=='G':
    print('C')
else :
    sys.exit()

Submission status: Accepted

Solution code:
d=input()
if d=='A':
  o='T'
elif d=='T':
  o='A'
elif d=='C':
  o='G'
else :
  o='C'
print(o)

Submission status: Accepted

Solution code:
base_pair = {
    "A": "T",
    "T": "A",
    "G": "C",
    "C": "G"
}
print(base_pair[input()])

Submission status: Accepted

Solution code:
def resolve():
    dic={'A':'T','T':'A','C':'G','G':'C'}

    b=input()
    print(dic[b])


resolve()

Submission status: Accepted

Solution code:
b = input()

if "A" == b:
    print("T")
elif "C" == b:
    print("G")
elif "G" == b:
    print("C")
else:
    print("A")

Submission status: Accepted

Solution code:
b = input()
dic = {'A':'T','C':'G','T':'A','G':'C'}
print(dic.get(b))

Submission status: Accepted

Solution code:
b = str(input())

if b == 'A':
    print('T')

if b == 'T':
    print('A')

if b == 'C':
    print('G')

if b == 'G':
    print('C')

Submission status: Accepted

Solution code:
s = input()
if(s == 'T'):
  print("A")
elif(s == 'G'):
  print("C")
elif(s == 'C'):
  print("G")
else:
  print("T")

Submission status: Accepted

Solution code:
B={"A":"T","T":"A","C":"G","G":"C"}
b=input()
print(B[b])

Submission status: Accepted

Solution code:
s = input()

if s == 'A' :
    print('T')
if s == 'T' :
    print('A')
if s == 'C' :
    print('G')
if s == 'G' :
    print('C')

Submission status: Accepted

Solution code:
s="ATACGC";print(s[s.index(input())+1])

Submission status: Accepted

Solution code:
#import sys
#input = sys.stdin.readline
'''
allinputs = iter(input().splitlines())
input = lambda : next(allinputs)
#'''

c = str(input())
if c == 'A':
	print('T')
elif c == 'T':
	print('A')
elif c == 'C':
	print('G')
else:
	print('C')

Submission status: Accepted

Solution code:
inp = input()
if inp == "A":
    print("T")
elif inp == "T":
    print("A")
elif inp == "G":
    print("C")
else:
    print("G")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

b = input()

if b == 'A':
    print('T')
elif b == 'T':
    print('A')
elif b == 'C':
    print('G')
elif b == 'G':
    print('C')

Submission status: Accepted

Solution code:
b = str(input())

if b == "A":
  print("T")
elif b=="C":
  print("G")
elif b=="G":
  print("C")
else:
  print("A")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a = input()

if a =='A':
  print('T')
elif a =='T':
  print('A')
elif a == 'G':
  print('C')
elif a == 'C':
  print('G')

Submission status: Accepted

Solution code:
name = input()
if name == 'A':
  print('T')
elif name == 'T':
  print('A')
elif name == 'G':
  print('C')
elif name == 'C':
  print('G')

Submission status: Accepted

Solution code:
b = input()

if b == 'A':
  print('T')

elif b == 'T':
  print('A')

elif b == 'C':
  print('G')
  
else:
  print('C')

Submission status: Accepted

Solution code:
b = input()
if b == "A":
  print("T")
elif b == "T":
  print("A")
elif b == "C":
  print("G")
else:
  print("C")

Submission status: Accepted

Solution code:
ch = input()
if ch == "A":
    print("T")
elif ch == "T":
    print("A")
elif ch == "G":
    print("C")
elif ch == "C":
    print("G")

Submission status: Accepted

Solution code:
b=input()

if b=="A":
    print("T")

elif b=="C":
    print("G")

elif b=="T":
    print("A")

else:
    print("C")

Submission status: Accepted

Solution code:
s = input()

if s == 'A':
  print('T')
elif s == 'T':
  print('A')
elif s == 'G':
  print('C')
elif s == 'C':
  print('G')

Submission status: Accepted

Solution code:
base = input()

if base == "a" or base == "A":
    print("T")
elif base == "t" or base == "T":
    print("A")
elif base == "c" or base == "C":
    print("G")
elif base == "g" or base == "G":
    print("C")

Submission status: Accepted

Solution code:
b = input()

if(b == 'A'):
    print('T')
elif(b == 'T'):
    print('A')
elif(b == 'C'):
    print('G')
else:
    print('C')

Submission status: Accepted

Solution code:
b=input()
A={'A':"T", 'C':"G", 'G':"C", 'T':"A" }
print(A[b])

Submission status: Accepted

Solution code:
b = input()

print("A" if b == "T" else "T" if b == "A" else "C" if b == "G" else "G")

Submission status: Accepted

Solution code:
s = input()

if s == "A":
  print("T")
elif s == "T":
  print("A")
elif s == "G":
  print("C")
else:
  print("G")

Submission status: Accepted

Solution code:
s = str(input())

if s=="A":
  print("T")
elif s=="T":
  print("A")
elif s=="C":
  print("G")
else:
  print("C")

Submission status: Accepted

Solution code:
star = input()

if star == "A":
    print("T")
elif star == "C":
    print("G")
elif star == "T":
    print("A")
elif  star == "G":
    print("C")

Submission status: Accepted

Solution code:
b = input()
if b == 'A':
    print('T')
elif b == 'T':
    print('A')
elif b == 'C':
    print('G')
else :
    print('C')

Submission status: Accepted

Solution code:
d={"A":"T","C":"G","G":"C","T":"A"}
print(d[input()])

Submission status: Accepted

Solution code:
b = input()
o = ('A' if b == 'T' else
     'C' if b == 'G' else
     'G' if b == 'C' else
     'T')
print(o)

Submission status: Accepted

Solution code:
b=input()
if b== 'A' :
	print( 'T')
elif b == 'C' :
	print( 'G')
elif b == 'G':
	print( 'C')
else:
  print('A')

Submission status: Accepted

Solution code:
b = str(input())

if b == "A":
    print("T")

if b == "T":
    print("A")

if b == "C":
    print("G")

if b == "G":
    print("C")

Submission status: Accepted

Solution code:
ans ={"A":"T","T":"A","G":"C","C":"G"}
print(ans[input()])

Submission status: Accepted

Solution code:
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


# aとbの最大公約数
def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


# aとbの最小公倍数
def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


def main():
    b = input()
    m = {"A": "T", "T": "A", "C": "G", "G": "C"}

    print(m[b])


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
l=input()
print("A" if l=="T" else "T" if l=="A" else "G" if l=="C" else "C")

Submission status: Accepted

Solution code:
base = ["A", "C", "G", "T"]
twin = ["T", "G", "C", "A"]

a = input()

print(twin[base.index(a)])

Submission status: Accepted

Solution code:
b = input()
c = {'A':'T', 'T':'A', 'G':'C', 'C':'G'}
print(c[b])

Submission status: Accepted

Solution code:
base = input()
if base == 'A':
    print('T')
elif base == 'T':
    print('A')
elif base == 'C':
    print('G')
else:
    print('C')

Submission status: Accepted

Solution code:
b = input()
if b == 'A':
    print('T')
if b == 'T':
    print('A')
if b == 'G':
    print('C')
if b == 'C':
    print('G')

Submission status: Accepted

Solution code:
b = input()

if b == "A":
    print("T")
elif b == "T":
    print("A")
elif b == "G":
    print("C")
elif b == "C":
    print("G")

Submission status: Accepted

Solution code:

mo_ji = input()

if mo_ji == "A":
    mo_ji = "T"
elif mo_ji == "C":
    mo_ji = "G"
elif mo_ji == "G":
    mo_ji = "C"
elif mo_ji == "T":
    mo_ji = "A"

print(mo_ji)

Submission status: Accepted

Solution code:
b = input()
dict = {'A':'T','T':'A','C':'G','G':'C'}
print(dict[b])

Submission status: Accepted

Solution code:
a = input()

if a == 'A':
	print('T')
if a == 'T':
	print('A')
if a == 'G':
	print('C')
if a == 'C':
	print('G')

Submission status: Accepted

Solution code:
s = input()
if s == "A" :
  print("T")
elif s=="T" :
  print("A")
elif s=="C" :
  print("G")
else :
  print("C")

Submission status: Accepted

Solution code:
def main():
    base = input()

    if base == 'A':
        print('T')
    elif base == 'T':
        print('A')
    elif base == 'G':
        print('C')
    elif base == 'C':
        print('G')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
b = input().rstrip()
if b == 'A':
  print('T')
elif b == 'T':
  print('A')
elif b == 'C':
  print('G')
elif b == 'G':
  print('C')

Submission status: Accepted

Solution code:
x = input()
print([[["C","G"][x=="C"],"T"][x=="A"],"A"][x=="T"])

Submission status: Accepted

Solution code:
k = input()
m = (k=="A" and "T") or (k=="T" and "A") or (k=="C" and "G") or (k=="G" and "C")
print(m)

Submission status: Accepted

Solution code:
#-*- coding: utf-8 -*-
b=str(input())

if b == "A":
    print("T")
elif b == "T":
    print("A")
elif b == "C":
    print("G")
elif b == "G":
    print("C")

Submission status: Accepted

Solution code:
#Coding:Utf-8

b=input()

if b=="A":
    print("T")
elif b=="T":
    print("A")
elif b=="C":
    print("G")
else:
    print("C")

Submission status: Accepted

Solution code:
def sub():
    b = input()
    if b == "A":
        print("T")
    elif b == "T":
        print("A")
    elif b == "C":
        print("G")
    else:
        print("C")

sub()

Submission status: Accepted

Solution code:
str = input()
if str == "A":
  print("T")
elif str == "T":
  print("A")
elif str == "G":
  print("C")
elif str == "C":
  print("G")

Submission status: Accepted

Solution code:
print(['A','T','C','G'][['T','A','G','C'].index(input())])

Submission status: Accepted

Solution code:
# abc122_a
b = input()
dict = {"A":"T","C":"G","T":"A","G":"C"}
print(dict[b])

Submission status: Accepted

Solution code:
a=input()
if a=='A':
    print('T')
elif a=='T':
    print('A')
elif a=='C':
    print('G')
else:
    print('C')

Submission status: Accepted

Solution code:
a = input()
if a == "A":
  print("T")
if a == "T":
  print("A")
if a == "G":
  print("C")
if a == "C":
  print("G")

Submission status: Accepted

Solution code:
dic = {"A":"T","C":"G","G":"C","T":"A"}
print(dic[input()])

Submission status: Accepted

Solution code:
m = {'A':'T', 'T':'A', 'C':'G', 'G':'C'}

print(m[input()])

Submission status: Accepted

Solution code:
b=input()
if b=="A":
  print("T")
elif b=="C":
  print("G")
elif b=="T":
  print("A")
elif b=="G":
  print("C")

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

a = input()

if(a == "A"):
    print("T")
elif( a == "T"):
    print("A")
elif( a == "G"):
    print("C")
else:
    print("G")

Submission status: Accepted

Solution code:
b = str(input())

if b == "A" :
    print("T")
elif b == "T" :
    print("A")
elif b == "C" :
    print("G")
else :
    print("C")

Submission status: Accepted

Solution code:
base_letter = input()

matching_bases = {
    'A': 'T',
    'C': 'G',
    'T': 'A',
    'G': 'C'
}

if base_letter in matching_bases:
    print(matching_bases[base_letter])

Submission status: Accepted

Solution code:
p='ACGTTGCA'
print(p[p.find(input())+4])

Submission status: Accepted

Solution code:
a = input()
if a == 'A':
    print('T')
elif a == 'T':
    print('A')
elif a == 'G':
    print('C')
elif a == 'C':
    print('G')

Submission status: Accepted

Solution code:
b = input()

if (b=="T"):
  print("A")
elif(b=="A"):
  print("T")
elif(b=="C"):
  print("G")
else:
  print("C")

Submission status: Accepted

Solution code:
b = input()
if b=='A':
	print('T')
if b=='T':
	print('A')
if b=='G':
	print('C')
if b=='C':
	print('G')

Submission status: Accepted

Solution code:
import sys

b=input()
if(b=='A'):
    ans='T'
elif(b=='T'):
    ans='A'
elif(b=='C'):
    ans='G'
elif(b=='G'):
    ans='C'

print(ans)

Submission status: Accepted

Solution code:
b = input()

if b == 'A':
    print('T')
elif b == 'T':
    print('A')
elif b == 'C':
    print('G')
elif b == 'G':
    print('C')
else:
    pass

Submission status: Accepted

Solution code:
x=input()
if x=='A':
  print('T')
elif x=='T':
  print('A')
elif x=='C':
  print('G')
elif x=='G':
  print('C')
else:
  pass

Submission status: Accepted

Solution code:
s = input()

if (s == 'A'):
    out = 'T'
elif (s == 'T'):
    out = 'A'
elif (s == 'C'):
    out = 'G'
else:
    out = 'C'

print(out)

Submission status: Accepted

Solution code:
b = input()
if b == "A":
    ans = "T"
if b == "C":
    ans = "G"
if b == "G":
    ans = "C"
if b == "T":
    ans = "A"
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(b: str):
    if b == "A":
        print("T")
    if b == "T":
        print("A")
    if b == "C":
        print("G")
    if b == "G":
        print("C")


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    b = next(tokens)  # type: str
    solve(b)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

b = input()

if b is 'A':
    print('T')
elif b is 'T':
    print('A')
elif b is 'C':
    print('G')
elif b is 'G':
    print('C')

Submission status: Accepted

Solution code:
d = {'A':'T','T':'A','C':'G','G':'C'}
b = input()
print(d[b])

Submission status: Accepted

Solution code:
s = input()
if s == "A" : s = "T"
elif s == "T" : s = "A"
elif s == "C" : s = "G"
else : s = "C"
print(s)

Submission status: Accepted

Solution code:
import sys


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

# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}


a = str(input())
dic = {"A": "T", "T": "A", "C": "G", "G": "C"}
print(dic[a])

Submission status: Accepted

Solution code:
a = input()
if a == "A":
    print("T")
if a == "T":
    print("A")
if a == "G":
    print("C")
if a == "C":
    print("G")

Submission status: Accepted

Solution code:
b = str(input())

if b == "A":
  print("T")
elif b == "T":
  print("A")
elif b == "G":
  print("C")
else:
  print("G")

Submission status: Accepted

Solution code:
def m():
    s = input()
    if s == 'A':
        return 'T'
    if s == 'T':
        return 'A'
    if s == 'G':
        return 'C'
    if s == 'C':
        return 'G'
print(m())

Submission status: Accepted

Solution code:
b=input()
pair={"A":"T","C":"G","T":"A","G":"C"}
print(pair[b])

Submission status: Accepted

Solution code:
x=input()

if x=="A":
  print("T")
elif x=="T":
  print("A")
elif x=="C":
  print("G")
else:
  print("C")

Submission status: Accepted

Solution code:
b = input()
AT = ["A", "T"]
CG = ["C", "G"]
if b in AT:
    if b == AT[0]:
        print(AT[1])
    else:
        print(AT[0])
elif b in CG:
    if b == CG[0]:
        print(CG[1])
    else:
        print(CG[0])

Submission status: Accepted

Solution code:
print({
    'A': 'T',
    'C': 'G',
    'G': 'C',
    'T': 'A',
}[input().strip()])

Submission status: Accepted

Solution code:
def main():
    n = input()
    if n =='A':
        print('T')
    elif n =='T':
        print('A')
    elif n =='C':
        print('G')
    else:
        print('C')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
print({'A': 'T', 'T': 'A', 'C': 'G', 'G': 'C'}[input()])

Submission status: Accepted

Solution code:
l = str.maketrans('ACGT', 'TGCA')
b = input().translate(l)
print(b)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Mon May 13 15:09:45 2019

@author: avina
"""

d = {'A' : 'T', 'C': 'G', 'G':'C', 'T':'A'}
g = input().strip()
print(d[g])

Submission status: Accepted

Solution code:
b = input().split()[0]
m = dict()
m["A"] = "T"
m["T"] = "A"
m["C"] = "G"
m["G"] = "C"
print(m[b])

Submission status: Accepted

Solution code:
b = input()

if b =="A":
  ret = "T"
elif b == "T": 
  ret = "A"
elif b == "G": 
  ret = "C"
elif b == "C": 
  ret = "G"
print(ret)

Submission status: Accepted

Solution code:
b=input()
if b=="A":
  print("T")
if b=="T":
  print("A")
if b=="G":
  print("C")
if b=="C":
  print("G")

Submission status: Accepted

Solution code:
from sys import stdin
b = stdin.readline().rstrip()

if b == 'A':
    print('T')
elif b == 'T':
    print('A')
elif b == 'C':
    print('G')
elif b == 'G':
    print('C')

Submission status: Accepted

Solution code:
b = input()
if b == "T":
    print("A")
elif b == "A":
    print("T")
elif b == "G":
    print("C")
else:
    print("G")

Submission status: Accepted

Solution code:
N=input()
if N=="A":
    print("T")
elif N=="T":
    print("A")
elif N=="C":
    print("G")
elif N=="G":
    print("C")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# input
b = input()

ans = {"A":"T", "T":"A", "C":"G", "G":"C"}
print(ans[b])

Submission status: Accepted

Solution code:
abc = input()

if abc == 'A':
    print("T")
elif  abc == 'T':
    print("A")
elif abc == 'C':
    print("G")
elif  abc == 'G':
    print("C")

Submission status: Accepted

Solution code:
l = ['A', 'C', 'T', 'G']
b = input()
for i in range(4):
    if l[i] == b:
        print(l[(i+2)%4])
        break

Submission status: Accepted

Solution code:
import sys

b = input()

if b == 'A':
    print("T")
    sys.exit()
if b == 'T':
    print("A")
    sys.exit()
if b == 'C':
    print("G")
    sys.exit()
print("C")

Submission status: Accepted

Solution code:
b = input()
ans = {"A": "T", "T": "A", "C": "G", "G":"C"}

print(ans[b])

Submission status: Accepted

Solution code:
pat = str.maketrans("ATCG", "TAGC")
print(input().translate(pat))

Submission status: Accepted

Solution code:
s =  input()

if s == 'C':
    print('G')
elif s== 'G':
    print('C')
elif s=='A':
    print('T')
else:
    print('A')

Submission status: Accepted

Solution code:
b=input()
if b=='A':
    print('T')
elif b=='T':
    print('A')
elif b=='G':
    print('C')
elif b=='C':
    print('G')

Submission status: Accepted

Solution code:
p = {
    'A': 'T',
    'T': 'A',
    'C': 'G',
    'G': 'C'
}

print(p[input()])

Submission status: Accepted

Solution code:
enki = input()
if enki == 'A':
    print('T')
elif enki == 'T':
    print('A')
elif enki == 'G':
    print('C')
else:
    print('G')

Submission status: Accepted

Solution code:
b = str(input())

if b == 'A' :
	print('T')
elif b == 'T':
	print('A')
elif b == 'C':
	print('G')
elif b == 'G':
	print('C')

Submission status: Accepted

Solution code:
a=input()

if a=="G":
  print("C")
elif a=="C":
  print("G")
elif a=="T":
  print("A")
elif a=="A":
  print("T")

Submission status: Accepted

Solution code:
b = input()
if b == "A":
 print("T")
elif b == "T":
 print("A")
elif b == "C":
 print("G")
elif b == "G":
 print("C")

Submission status: Accepted

Solution code:
b = input()

g = {
	"A": "T",
	"C": "G",
	"G": "C",
	"T": "A"
}

print(g[b])

Submission status: Accepted

Solution code:
BASE_PAIRS = [['A', 'T'], ['C', 'G']]
base_b = input()
result = ''

for i in range(len(BASE_PAIRS)):
    if base_b in BASE_PAIRS[i]:
        paired_base_index = (BASE_PAIRS[i].index(base_b)+1) % 2
        result = BASE_PAIRS[i][paired_base_index]

print(result)

Submission status: Accepted

Solution code:
b = input()
dic = {'A':'T','C':'G','T':'A','G':'C'}
print(dic[b])

Submission status: Accepted

Solution code:
b=input()
base={"A":"T","T":"A","C":"G","G":"C"}
print(base[b])

Submission status: Accepted

Solution code:
b = input()

if b=='A':
    print("T")
elif b=='T':
    print('A')
elif b=='G':
    print('C')
elif b=='C':
    print('G')

Submission status: Accepted

Solution code:
b = input()

if b is "A":
  print("T")
elif b is "T":
  print("A")
elif b is "C":
  print("G")
else:
  print("C")

Submission status: Accepted

Solution code:
b = input()
d = {"A": "T", "C":"G", "G":"C", "T":"A"}
print(d[b])

Submission status: Accepted

Solution code:
b=input()
if b=='A':
    print('T')
elif b=='C':
    print('G')
elif b=='G':
    print('C')
else:
    print('A')

Submission status: Accepted

Solution code:
b=input()
r = ""
if b == "A":
    r = "T"
elif b == "T":
    r = "A"
elif b == "C":
    r = "G"
elif b == "G":
    r = "C"
print(r)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3


def main():
    b = input()
    d = {
            'A': 'T',
            'C': 'G',
            'G': 'C',
            'T': 'A'
        }
    print(d[b])


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
b = input()

base = {"A": "T", "T": "A", "G": "C", "C": "G"}

print(base[b])

Submission status: Accepted

Solution code:
x = input()
if x == 'A':
	print('T')
elif x == 'T':
	print('A')
elif x == 'C':
	print('G')
else:
	print('C')

Submission status: Accepted

Solution code:
b = input()
dic = {'A':'T', 'C':'G'}

s = dic.get(b)
if s == None:
    if b == 'T':
        print('A')
    else:
        print('C')
else:
    print(s)

Submission status: Accepted

Solution code:

b = input()

out = ''
if b == 'A':
    out = 'T'
elif b == 'T':
    out = 'A'
elif b == 'C':
    out = 'G'
else:
    out = 'C'

print(out)

Submission status: Accepted

Solution code:
b = input()
d = {'A': 'T', 'T': 'A', 'G': 'C', 'C': 'G'}
print(d[b])

Submission status: Accepted

Solution code:
b = input()
if b == "A":
    print("T")
if b == "T":
    print("A")
if b == "G":
    print("C")
if b == "C":
    print("G")

Submission status: Accepted

Solution code:
b = input()

if b == "A":
  print("T")
elif b == "C":
  print("G")
elif b == "G":
  print("C")
else:
  print("A")

Submission status: Accepted

Solution code:
b = input()
ans = {'A': 'T', 'T': 'A', 'C': 'G', 'G': 'C'}
print(ans[b])

Submission status: Accepted

Solution code:
b = input()

if b == 'A':
    ans = 'T'
elif b == 'T':
    ans = 'A'
elif b == 'C':
    ans = 'G'
else:
    ans = 'C'
    
print(ans)

Submission status: Accepted

Solution code:
a={"A":"T","T":"A","C":"G","G":"C"}
s=input()
print(a[s])

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

s = input().strip()
m = {
    "A": "T",
    "T": "A",
    "C": "G",
    "G": "C",
}

print(m[s])

Submission status: Accepted

Solution code:
b = input()

if (b == 'A'):
    print('T')
elif (b == 'T'):
    print('A')
elif (b == 'C'):
    print('G')
else:
    print('C')

Submission status: Accepted

Solution code:
b = input()

a = {'A': 'T',
     'C': 'G',
     'G': 'C',
     'T': 'A',
    }

print(a[b])

Submission status: Accepted

Solution code:
b = input()
m = {"A":"T","T":"A","C":"G","G":"C"}
print(m[b])

Submission status: Accepted

Solution code:
b = input()
if b =="A":
  print("T")
elif b =="T":
  print("A")
elif b =="C":
  print("G")
else:
  print("C")

Submission status: Accepted

Solution code:
###############################################################################

from bisect import bisect_left as binl

def intin():
    input_tuple = input().split()
    if len(input_tuple) <= 1:
        return int(input_tuple[0])
    return map(int, input_tuple)


def intina():
    return [int(i) for i in input().split()]


def intinl(count):
    return [intin() for _ in range(count)]


def lcm(x, y):
    while y != 0:
        z = x % y
        x = y
        y = z
    return x


###############################################################################


def main():
    b = input()

    if b == 'A':
        print('T')
    if b == 'T':
        print('A')
    if b == 'C':
        print('G')
    if b == 'G':
        print('C')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
b=input()

if b== "A":
  print("T")
elif b=="T":
  print("A")
elif b=="G":
  print("C")
else:
  print("G")

Submission status: Accepted

Solution code:
print({"A":"T","T":"A","C":"G","G":"C"}[str(input())[:1]])

Submission status: Accepted

Solution code:
b=input()
dic={'T':'A','A':'T','G':'C','C':'G'}
print(dic[b])

Submission status: Accepted

Solution code:
item = input()
if item == 'A':
    result = 'T'
elif item == 'T':
    result = 'A'
elif item == 'C':
    result = 'G'
else:
    result = 'C'
print(result)

Submission status: Accepted

Solution code:
b = input()
if b == 'A':
  print('T')
elif b == 'T':
  print('A')
elif b == 'C':
  print('G')
elif b == 'G':
  print('C')
else:
  pass

Submission status: Accepted

Solution code:
s = input()
if s == "A":
  print("T")
if s == "T":
  print("A")
if s == "C":
  print("G")
if s == "G":
  print("C")

Submission status: Accepted

Solution code:
b= input()
print('A' if b == 'T' else 'T' if b=='A' else 'C' if b=='G' else 'G')

Submission status: Accepted

Solution code:
#coding:utf-8

def main():
    b = input()
    b = b.upper()
    if b == "A":
        print("T")
    elif b == "T":
        print("A")
    elif b == "G":
        print("C")
    elif b == "C":
        print("G")

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
print("ACGT"["TGCA".find(input())])

Submission status: Accepted

Solution code:
b = input()
if b == 'A':
    b = 'T'
elif b == 'T':
    b = 'A'
elif b == 'G':
    b = 'C'  
else:
    b = 'G'  
 
print(b)

Submission status: Accepted

Solution code:
dics = {"A":"T","T":"A","C":"G","G":"C"}

print(dics[str(input())])

Submission status: Accepted

Solution code:
s = input()
if s=='A':print('T')
elif s=='T':print('A')
elif s=='C':print('G')
elif s=='G':print('C')

Submission status: Accepted

Solution code:
b = str(input())

if b == str('A'):
    print("T")
    exit()
elif b == str('T'):
    print("A")
    exit()
elif b == str('G'):
    print("C")
    exit()
else:
    print("G")
    exit()

Submission status: Accepted

Solution code:

b=str(input())

if b=='T':
    print('A')
elif b=='A':
    print('T')
elif b=='G':
    print('C')
elif b=='C':
    print('G')

Submission status: Accepted

Solution code:
a = input()

if a == 'A' or a =='T':
  if a == 'A':
    print('T')
  else:
    print('A')
else:
  if a == 'G':
    print('C')
  else:
    print('G')

Submission status: Accepted

Solution code:
s = input()
ans = {'A': 'T', 'T': 'A', 'C': 'G', 'G': 'C'}
print(ans[s])

Submission status: Accepted

Solution code:
b = input()

b = b.replace('A','a')
b = b.replace('T','t')
b = b.replace('G','g')
b = b.replace('C','c')

b = b.replace('a','T')
b = b.replace('t','A')
b = b.replace('g','C')
b = b.replace('c','G')

print(b)

Submission status: Accepted

Solution code:
a = input()
print("T" if a == "A" else
      "A" if a == "T" else
      "G" if a == "C" else
      "C")

Submission status: Accepted

Solution code:
b=input()
e={'A':'T', 'C':'G', 'G':'C', 'T':'A'}
print(e[b])

Submission status: Accepted

Solution code:
b=input()
if b=='A':
    print('T')
elif b=='T':
    print('A')
elif b=='C':
    print('G')
else:
    print('C')

Submission status: Accepted

Solution code:
def main():
  b=input()

  if b=="A":
    print("T")
  elif b=="C":
    print("G")
  elif b=="G":
    print("C")
  elif b=="T":
    print("A")

main()

Submission status: Accepted

Solution code:
raw_data = input().split(" ")                                                    

for i in raw_data:
    if i == "A":
        print("T")

    elif i == "C":
        print("G")

    elif i == "T":
        print("A")

    elif i == "G":
        print("C")

Submission status: Accepted

Solution code:
d={"A":"T","T":"A","C":"G","G":"C"};print(d[input()])