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: Runtime Error

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

Submission status: Runtime Error

Solution code:
str = input()

if str = 'A':
  print('T')
else if str ='T':
  print('A')
else if str ='C':
  print('G')
else if str ='G':
  print('C')
else:
  print('error')

Submission status: Runtime Error

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

~                                                                                                    
~                                                                                                    
~                                                                                                    
~                                                                                                    
~

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <math.h>
#include <algorithm>
#define ll long long int
#define FOR(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, n)

using namespace std;

int main()
{
    string b;
    cin >> b;
    if (b == "A")
        cout << "T" << endl;
    else if (b == "T")
        cout << "A" << endl;
    else if (b == "C")
        cout << "G" << endl;
    else
        cout << "C" << endl;

    return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
base = input()
a = ['A', 'T']
b = ['G', 'C']
if base in a:
  print([a[0], a[1]][if base == 'A'])
else:
  print([b[0], b[1]][if base == 'G'])

Submission status: Runtime Error

Solution code:
I=input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
b=int(input())

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

Submission status: Runtime Error

Solution code:
def main():
    to = ['T', 'G']
    fr = ['A', 'C']

    print(to[fr.index(input())])


if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    b = S()
    b = b[0]
    if b == "A":
        print("T")
    elif b == "T"
        print("A")
    elif b == "C":
        print("G")
    elif b == "G":
        print("C")
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
if __name__ == "__main__":
    b = tuple(map(int, input().split(" ")))
    if b == "A":
        print("T")
    if b == "T":
        print("A")
    if b == "C":
        print("G")
    if b == "G":
        print("C")