Problem:


Score : 100 points

Problem Statement

An uppercase or lowercase English letter \alpha will be given as input.
If \alpha is uppercase, print A; if it is lowercase, print a.

Constraints

\alpha is an uppercase (A - Z) or lowercase (a - z) English letter.

Input

Input is given from Standard Input in the following format:

α

Output

If \alpha is uppercase, print A; if it is lowercase, print a.

Sample Input 1

B

Sample Output 1

A

B is uppercase, so we should print A.

Sample Input 2

a

Sample Output 2

a

a is lowercase, so we should print a.



Sample input:
B


Sample output:
A

Submission status: Runtime Error

Solution code:
ch = input()
if ch == a or ch == b or ch == c or ch == d or ch == e or ch == f or ch == g or ch == h:
  print(a)
elif ch == i or ch == j or ch == k or ch == l or ch == m or ch == n or ch == o:
  print(a)
elif ch == p or ch == q or ch == r or ch == s or ch == t or ch == u or ch == v:
  print(a)
elif ch == w or ch == x or ch == y or ch == z:
  print(a)
else
 print(b)

Submission status: Runtime Error

Solution code:
alf=input()
if alf.islower():
  print(a)
else:
  print(A)

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
	char a;
	cin >> a;
	if (isupper(a))cout << 'A';
	else
		cout << 'a';
}

Submission status: Runtime Error

Solution code:
t='qwertyuioplkjhgfdsazxcvbnm'
T='QWERTYUIOPLKJHGFDSAZXCVBNM'
a=str(input())
if a in t:
  print(a)
else:
  print(A)

Submission status: Runtime Error

Solution code:
t="qwertyuioplkjhgfdsazxcvbnm"
T="QWERTYUIOPLKJHGFDSAZXCVBNM"
a=str(input())
if a in t:
  print(a)
else:
  print(A)

Submission status: Runtime Error

Solution code:
α = int(input())
if α.isupper():
  print('A')
else:
  print('a')

Submission status: Runtime Error

Solution code:
α = int(input())
if str.isupper(α):
  print('A')
else:
  print('a')

Submission status: Runtime Error

Solution code:
α = int(input())
if str.isupper():
  print('A')
else:
  print('a')

Submission status: Runtime Error

Solution code:
if(a.isupper()==True):
        print("A")
    else:
        print("a")

Submission status: Runtime Error

Solution code:
 a = input()
    if(a.isupper()):
        print("A")
    else:
        print("a")

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python
# ---------------------------------------------------------------------------------------!
import os
import sys
from io import BytesIO, IOBase
# from bisect import bisect_left as bl                #c++ lowerbound bl(array,element)
# from bisect import bisect_right as br               #c++ upperbound br(array,element)


# ---------------------------------------MAIN()-----------------------------------------------!
def main():
    sys.stdin = open('input.txt', 'r')
    sys.stdout = open('output.txt', 'w')
    a = input()
    if(a.isupper()):
        print("A")
    else:
        print("a")


# -----------------------------------------------------------------------------------------!
# region fastio
BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def _init_(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def _init_(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
def input(): return sys.stdin.readline().rstrip("\r\n")

# endregion


if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
a = input()
if a = a.upper():
  print('A')
else:
  print('a')

Submission status: Runtime Error

Solution code:
A = input()

B = A.Upper()

if A == B:
    print("A")
else:
    print("a")

Submission status: Runtime Error

Solution code:
alpha = input()
a = [A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z]

if alpha in a:
  print('A')
else:
  print('a')

Submission status: Runtime Error

Solution code:
alpha = int(input())
a = [A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z]

if alpha in a:
  print('A')
else:
  print('a')

Submission status: Runtime Error

Solution code:
alpha = int(input())
a = [A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z]

if alpha in a:
  print('A')
else:
  prnt('a')

Submission status: Runtime Error

Solution code:
n = int(input())
ascii_letters = 'abcdefghijklmnopqrstuvwxyz'
minus=1
for i in range(1,15):
    if n<=26**i:
        order=i
        n-=minus
        break
    else:
        minus+=26**i

for i in range(order):
    print(ascii_letters[n//(26**(order-i-1))],end='')
    n%=(26**(order-i-1))
print()

Submission status: Runtime Error

Solution code:
a = input()

if a - 'A' >= 0:
  print(A)
else:
  print(a)

Submission status: Runtime Error

Solution code:
a = input()

if a - A >= 0:
  print(A)
else:
  print(a)

Submission status: Runtime Error

Solution code:
a = input()

if a >= A:
  print(A)
else:
  print(a)

Submission status: Runtime Error

Solution code:
α=input()
print("A" if a.islower() else "a")

Submission status: Runtime Error

Solution code:
def freq(my_list):
    count = {} 
    for i in my_list: 
        count[i] = count.get(i, 0) + 1
    return count

n = int(input())
l = list(map(int, input().split()))
s,f = sum(l), freq(l)
for _ in range(int(input())):
    x, y = map(int, input().split())
    if x in f:
        v = f[x]
        if y in f:
            f[y]+=v
            f.pop(x)
        else:
            f[y]=f.pop(x)
        s += (y-x)*v
    print(s)

Submission status: Runtime Error

Solution code:
c = input()
if c = c.lower():
  print('a')
else:
  print('A')

Submission status: Runtime Error

Solution code:
c = input()
if c = c.lower():
  	print('a')
else:
  print('A')

Submission status: Runtime Error

Solution code:
n = int(input())
AL = [chr(ord('a') + i) for i in range(26)]

def number_to_alphabet(n):
    N = n-1
    a = ''
    while True:
        d = N % 26
        a = AL[d]+ a
        if N == 0: break
        N = N//26-1
        if N < 0: break
    return a

print(number_to_alphabet(n))

Submission status: Runtime Error

Solution code:
a=string(input())
if a in "A"-"Z":
  print(A)
else:
  print(a)

Submission status: Runtime Error

Solution code:
a=string(input())
if a =="A"-"Z":
  print(A)
else:
  print(a)

Submission status: Runtime Error

Solution code:
a=input()
if a =="A"-"Z":
  print(A)
else:
  print(a)

Submission status: Runtime Error

Solution code:
a=input()
if a ==a-z:
  print(A)
else:
  print(a)

Submission status: Runtime Error

Solution code:
n=int(input())
c=""
while n:
    n-=1
    c=chr(n%26+97)+c
    n//=26
print(c)

Submission status: Runtime Error

Solution code:
a = input()
　 print('A' if a.islower() else 'a')

Submission status: Runtime Error

Solution code:
a = input()
2 print('A' if a.islower() else 'a')

Submission status: Runtime Error

Solution code:
a = input()
if a == type.lower():
    print('a')
elif a == type.upper():
    print('A')

Submission status: Runtime Error

Solution code:
N,K = map(int,input().split())
p = list(map(int,input().split()))
print(sum(sorted(p)[:K]))

Submission status: Runtime Error

Solution code:
Alp=input()
if Alp.isupper() = True :
	print('A')
  else:
	print('a')

Submission status: Runtime Error

Solution code:
while True:
    aw = input()
    if aw == "q"or"a"or"z"or"w"or"s"or"x"or"e"or"d"or"c"or"r"or"f"or"v"or"t"or"g"or"b"or"y"or"h"or"n"or"u"or"j"or"m"or"i"or"k"or"l"or"o"or"p":
        print("a")
    else:
        print("A")

Submission status: Runtime Error

Solution code:
n=input()
if n.islower:
  print(a)
else:
  print(A)

Submission status: Runtime Error

Solution code:
if input().isUpper():
  print('A')
else:
  print('a')

Submission status: Runtime Error

Solution code:
al = str(input())
if al.isupper() = true:
	print('A')
else:
	print('a')

Submission status: Runtime Error

Solution code:
c=input()
if(c.isupper()==True):
  	print('A')
else
	print('a')

Submission status: Runtime Error

Solution code:
num = input().split(" ")
num_all = int(num[0])
count = int(num[1])
cost = list(map(int, input().split()))
cost.sort()
last = 0
for i in range(count):
  last += cost[i]
print(last)

Submission status: Runtime Error

Solution code:
if input().upper()==input():
  print("A")
else:
  print("a")

Submission status: Runtime Error

Solution code:
use std::io;

fn input() -> String{
    let mut input:String = String::new();
    io::stdin().read_line(&mut input).unwrap();
    input
}

fn main() {
    let ch: char = input().as_str().chars().nth(0).unwrap();
    if ch.is_ascii_uppercase() {
        println!("A");
    } else {
        println!("a");
    }
}

Submission status: Runtime Error

Solution code:
s = input()
if 65<=ord(s)<=90:
  print(A)
else:
  print(a)

Submission status: Runtime Error

Solution code:
a = input()
if a.isupper():
    print(A)
else:
    print(a)

Submission status: Runtime Error

Solution code:
a = input()
if (a >= 'a' and a <= 'z'):
    print(A)
elif(a >= 'A' and a <= 'Z'):
    print(a)

Submission status: Runtime Error

Solution code:
a = input()
if (a >= 'a' and a <= 'z')
    print(A)
elif(a >= 'A' and a <= 'Z')
    print(a)

Submission status: Runtime Error

Solution code:
s=str(input())
if s.isupper()=True:
  print("A")
else:
  print("a")

Submission status: Runtime Error

Solution code:
x = input()
print('A') if isupper(x) else print('a')

Submission status: Runtime Error

Solution code:
N = int(input())
M = 'abcdefghijklmnopqrstuvwxyz'
L = []
res = ''

while(N>=26):
    N -= 1
    m = N % 26
    N = N // 26
    L = [m] + L

L = [N-1] + L

for m in L:
    res += M[m]
print(res)

Submission status: Runtime Error

Solution code:
  1 ini = lambda : int(input())
  2 inm = lambda : map(int,input().split())
  3 inl = lambda : list(map(int,input().split()))
  4 gcd = lambda x,y : gcd(y,x%y) if x%y else y
  5 a = input()
  6 if ord(a) < ord('a'):
  7         print('A')
  8 else: 
  9         print('a')

Submission status: Runtime Error

Solution code:
N=int(input())
if N==N.upper():
  print('A')
else :
  print('a')

Submission status: Runtime Error

Solution code:
x = input()

if s.is_super:
  print("A")
else:
  print("a")

Submission status: Runtime Error

Solution code:
x = input()

if x in [a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z]:
  print('a')
else:
  print('A')

Submission status: Runtime Error

Solution code:
N,K = list(map(int,input().split()))
P = list(map(int,input().split()))

def bubblesort(l):
    for index in range(len(l)-1, 0, -1):
        for low in range(index):
            if l[low] > l[low+1]:
                tmp = l[low+1]
                l[low+1] = l[low]
                l[low] = tmp
    return l

bubblesort(P)
sum = 0
for i in range(K):
	sum = sum + P[i]
print(sum)

Submission status: Runtime Error

Solution code:
a = input()

if a.isupper():
	print(A)
else:
	print(a)

Submission status: Runtime Error

Solution code:
alphabet = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
N = int(input())
if (N//26 < 1):
    c = alphabet[N-1]
elif (N//26 < 26):
    c = alphabet[(N//26**1)-1] + alphabet[(N-1)%26]
elif (N//26 < 26**2):
    c = alphabet[(N//(26**2))-1] + alphabet[((N//26)-1)%26] + alphabet[(N-1)%26]
elif (N//26 < 26**3):
    c = alphabet[(N//(26**3))-1] + alphabet[((N//(26**2))-1)%26] + alphabet[((N//26)-1)%26] + alphabet[(N-1)%26]
elif (N//26 < 26**4):
    c = alphabet[(N//(26**4))-1] + alphabet[((N//(26**3))-1)%26] + alphabet[((N//(26**2))-1)%26] + alphabet[((N//26)-1)%26] + alphabet[(N-1)%26]
elif (N//26 < 26**5):
    c = alphabet[(N//(26**5))-1] + alphabet[((N//(26**4))-1)%26] + alphabet[((N//(26**3))-1)%26] + alphabet[((N//(26**2))-1)%26] + alphabet[((N//26)-1)%26] + alphabet[(N-1)%26]
elif (N//26 < 26**6):
    c = alphabet[(N//(26**6))-1] + alphabet[((N//(26**5))-1)%26] + alphabet[((N//(26**4))-1)%26] + alphabet[((N//(26**3))-1)%26] + alphabet[((N//(26**2))-1)%26] + alphabet[((N//26)-1)%26] + alphabet[(N-1)%26]
elif (N//26 < 26**7):
    c = alphabet[(N//(26**7))-1] + alphabet[(N//(26**6))-1] + alphabet[((N//(26**5))-1)%26] + alphabet[((N//(26**4))-1)%26] + alphabet[((N//(26**3))-1)%26] + alphabet[((N//(26**2))-1)%26] + alphabet[((N//26)-1)%26] + alphabet[(N-1)%26]
elif (N//26 < 26**8):
    c = alphabet[(N//(26**8))-1] + alphabet[(N//(26**7))-1] + alphabet[(N//(26**6))-1] + alphabet[((N//(26**5))-1)%26] + alphabet[((N//(26**4))-1)%26]+ alphabet[((N//(26**3))-1)%26] + alphabet[((N//(26**2))-1)%26] + alphabet[((N//26)-1)%26] + alphabet[(N-1)%26]
elif (N//26 < 26**9):
    c = alphabet[(N//(26**9))-1] + alphabet[(N//(26**8))-1] + alphabet[(N//(26**7))-1] + alphabet[(N//(26**6))-1] + alphabet[((N//(26**5))-1)%26]+ alphabet[((N//(26**4))-1)%26] + alphabet[((N//(26**3))-1)%26] + alphabet[((N//(26**2))-1)%26] + alphabet[((N//26)-1)%26] + alphabet[(N-1)%26]
elif (N//26 < 26**10):
    c = alphabet[(N//(26**10))-1] + alphabet[(N//(26**9))-1] + alphabet[(N//(26**8))-1] + alphabet[(N//(26**7))-1] + alphabet[(N//(26**6))-1] + alphabet[((N//(26**5))-1)%26] + alphabet[((N//(26**4))-1)%26] + alphabet[((N//(26**3))-1)%26] + alphabet[((N//(26**2))-1)%26] + alphabet[((N//26)-1)%26]+ alphabet[(N-1)%26]
elif (N//26 < 26**11):
    c = alphabet[(N//(26**11))-1] + alphabet[(N//(26**10))-1] + alphabet[(N//(26**9))-1] + alphabet[(N//(26**8))-1] + alphabet[(N//(26**7))-1] + alphabet[(N//(26**6))-1] + alphabet[((N//(26**5))-1)%26] + alphabet[((N//(26**4))-1)%26] + alphabet[((N//(26**3))-1)%26] + alphabet[((N//(26**2))-1)%26] + alphabet[((N//26)-1)%26] + alphabet[((N//26)-1)%26]+ alphabet[(N-1)%26]
elif (N//26 < 26**12):
    c = alphabet[(N//(26**12))-1] + alphabet[(N//(26**11))-1] + alphabet[(N//(26**10))-1] + alphabet[(N//(26**9))-1] + alphabet[(N//(26**8))-1] + alphabet[(N//(26**7))-1] + alphabet[(N//(26**6))-1] + alphabet[((N//(26**5))-1)%26] + alphabet[((N//(26**4))-1)%26] + alphabet[((N//(26**3))-1)%26] + alphabet[((N//(26**2))-1)%26] + alphabet[((N//26)-1)%26] + alphabet[((N//26)-1)%26]+ alphabet[(N-1)%26]
else:
    c = 'a'
print(c)

Submission status: Runtime Error

Solution code:
import string
alphabet = list(string.ascii_lowercase)
N = int(input())
if (N//26 < 1):
    c = alphabet[N-1]
elif (N//26 < 26):
    c = alphabet[(N//26**1)-1] + alphabet[(N-1)%26]
elif (N//26 < 26**2):
    c = alphabet[(N//(26**2))-1] + alphabet[((N//26)-1)%26] + alphabet[(N-1)%26]
elif (N//26 < 26**3):
    c = alphabet[(N//(26**3))-1] + alphabet[((N//(26**2))-1)%26] + alphabet[((N//26)-1)%26] + alphabet[(N-1)%26]
elif (N//26 < 26**4):
    c = alphabet[(N//(26**4))-1] + alphabet[((N//(26**3))-1)%26] + alphabet[((N//(26**2))-1)%26] + alphabet[((N//26)-1)%26] + alphabet[(N-1)%26]
elif (N//26 < 26**5):
    c = alphabet[(N//(26**5))-1] + alphabet[((N//(26**4))-1)%26] + alphabet[((N//(26**3))-1)%26] + alphabet[((N//(26**2))-1)%26] + alphabet[((N//26)-1)%26] + alphabet[(N-1)%26]
elif (N//26 < 26**6):
    c = alphabet[(N//(26**6))-1] + alphabet[((N//(26**5))-1)%26] + alphabet[((N//(26**4))-1)%26] + alphabet[((N//(26**3))-1)%26] + alphabet[((N//(26**2))-1)%26] + alphabet[((N//26)-1)%26] + alphabet[(N-1)%26]
elif (N//26 < 26**7):
    c = alphabet[(N//(26**7))-1] + alphabet[(N//(26**6))-1] + alphabet[((N//(26**5))-1)%26] + alphabet[((N//(26**4))-1)%26] + alphabet[((N//(26**3))-1)%26] + alphabet[((N//(26**2))-1)%26] + alphabet[((N//26)-1)%26] + alphabet[(N-1)%26]
elif (N//26 < 26**8):
    c = alphabet[(N//(26**8))-1] + alphabet[(N//(26**7))-1] + alphabet[(N//(26**6))-1] + alphabet[((N//(26**5))-1)%26] + alphabet[((N//(26**4))-1)%26]+ alphabet[((N//(26**3))-1)%26] + alphabet[((N//(26**2))-1)%26] + alphabet[((N//26)-1)%26] + alphabet[(N-1)%26]
elif (N//26 < 26**9):
    c = alphabet[(N//(26**9))-1] + alphabet[(N//(26**8))-1] + alphabet[(N//(26**7))-1] + alphabet[(N//(26**6))-1] + alphabet[((N//(26**5))-1)%26]+ alphabet[((N//(26**4))-1)%26] + alphabet[((N//(26**3))-1)%26] + alphabet[((N//(26**2))-1)%26] + alphabet[((N//26)-1)%26] + alphabet[(N-1)%26]
elif (N//26 < 26**10):
    c = alphabet[(N//(26**10))-1] + alphabet[(N//(26**9))-1] + alphabet[(N//(26**8))-1] + alphabet[(N//(26**7))-1] + alphabet[(N//(26**6))-1] + alphabet[((N//(26**5))-1)%26] + alphabet[((N//(26**4))-1)%26] + alphabet[((N//(26**3))-1)%26] + alphabet[((N//(26**2))-1)%26] + alphabet[((N//26)-1)%26]+ alphabet[(N-1)%26]
elif (N//26 < 26**11):
    c = alphabet[(N//(26**11))-1] + alphabet[(N//(26**10))-1] + alphabet[(N//(26**9))-1] + alphabet[(N//(26**8))-1] + alphabet[(N//(26**7))-1] + alphabet[(N//(26**6))-1] + alphabet[((N//(26**5))-1)%26] + alphabet[((N//(26**4))-1)%26] + alphabet[((N//(26**3))-1)%26] + alphabet[((N//(26**2))-1)%26] + alphabet[((N//26)-1)%26] + alphabet[((N//26)-1)%26]+ alphabet[(N-1)%26]
elif (N//26 < 26**12):
    c = alphabet[(N//(26**12))-1] + alphabet[(N//(26**11))-1] + alphabet[(N//(26**10))-1] + alphabet[(N//(26**9))-1] + alphabet[(N//(26**8))-1] + alphabet[(N//(26**7))-1] + alphabet[(N//(26**6))-1] + alphabet[((N//(26**5))-1)%26] + alphabet[((N//(26**4))-1)%26] + alphabet[((N//(26**3))-1)%26] + alphabet[((N//(26**2))-1)%26] + alphabet[((N//26)-1)%26] + alphabet[((N//26)-1)%26]+ alphabet[(N-1)%26]
else:
    c = 'a'
print(c)

Submission status: Runtime Error

Solution code:
TN=input()
list=[a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z]
if TN not in list:
  print("A")
else:
  print("a")

Submission status: Runtime Error

Solution code:
a=input()
list=[a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z]
if a not in list:
  print("A")
else:
  print("a")

Submission status: Runtime Error

Solution code:
a=input()
list=[a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z]
if a in list==False:
  print("A")
else:
  print("a")

Submission status: Runtime Error

Solution code:
a=input()
list=[a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z]
if list(a)==False:
  print("A")
else:
  print("a")

Submission status: Runtime Error

Solution code:
a=str(input())
list=[a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z]
if list(a)=False:
  print("A")
else:
  print("a")

Submission status: Runtime Error

Solution code:
a=input()
list=[a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z]
if list(a)=False:
  print("A")
else:
  print("a")

Submission status: Runtime Error

Solution code:
n, k = map(int, input().split())

data = list(map(int, input().split() ))
data.sort()
print(sum(data[0:k]))

Submission status: Runtime Error

Solution code:
n=str(input())
if n.islowere:
 print('a')
else:
 print('A')

Submission status: Runtime Error

Solution code:
n,k= map(int , input().split())

p=list(map(int,input().split()))
p.sort()
ans =0
for i in range(k):
	ans+= p[i]
print(ans)

Submission status: Runtime Error

Solution code:
a = input()
ans = upper(a)
if a == ans:
  print("A")
else:
  print("a")

Submission status: Runtime Error

Solution code:
a = str(input())
ans = str(upper(a))
if a = ans:
  print("A")
else:
  print("a")

Submission status: Runtime Error

Solution code:
a = input()
ans = upper(a)
if a = ans:
  print("A")
else:
  print("a")

Submission status: Runtime Error

Solution code:
n,k=map(int,input().split())
a=list(map(int,input().split())
a.sort()
print(sum(a[:k]))

Submission status: Runtime Error

Solution code:
n,k=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
print(sum(a[:k]))

Submission status: Runtime Error

Solution code:
import re

a = input()
if re.match(r'[a-z]', a) is not None:
	print 'a'
else:
	print 'A'

Submission status: Runtime Error

Solution code:
a = input()
if re.match(r'[a-z]', a) :
	print 'a'
else:
	print 'A'

Submission status: Runtime Error

Solution code:
N = int(input())
ans = ""

while N > 0:
	N -= 1
	ans += chr(ord('a') + N % 26)
	N //= 26

print(ans[::-1])

Submission status: Runtime Error

Solution code:
num = int(input())
res = ""

while num != 0:
	num -= 1
	rem = num % 26
	res += chr(ord('a') + rem)
	num //= 26

print(res)

Submission status: Runtime Error

Solution code:
str = input()
if str.isupper()==TRUE:
  print("A")
else:
  print("a")

Submission status: Runtime Error

Solution code:
n,k = input().split()
k = int(k)
#print(n,k)
p = [int(s) for s in input().split()]
p.sort()
#print(p)
#print(k)
p2 = p[0:k]
#print(p2)
s = sum(p)
#print(s)
print(sum(p2))

Submission status: Runtime Error

Solution code:
c=input()
if "A"<=c&&c<="Z":
  print("A")
else:
  print("a")

Submission status: Runtime Error

Solution code:
a = input()
if a.isUpper():
  print('A')
else:
  print('a')

Submission status: Runtime Error

Solution code:
n, k = map(int,input().split())
a = sorted(list(map(int,input().split())))
print(sum(a[:k]))

Submission status: Runtime Error

Solution code:
N=int(input())
List='a b c d e f g h i j k l m n o p q r s t u v d x y z'.split()
print(List)

Ans=''

while N>=1:
    Amari=N%26
    
    if Amari==0:
        Ans='z'+Ans
    else:
        Ans=List[Amari-1]+Ans
        
    N=(N-1)//26
    
print(Ans)

Submission status: Runtime Error

Solution code:
N = input()

s = "abcdefghijklmnopqrstuvwxyz"
ans = ""
n, m = 0, 0

for i in range(1, 1000):
    m += 26 ** i
    if N <= m:
        n = i
        break

for i in range(n):
    a, b = divmod(N, 26)
    N = a
    if b == 0:
        ans += s[25]
        N -= 1
    else:
        ans += s[b-1]

ans1 = ''.join(list(reversed(ans)))
print(ans1)

Submission status: Runtime Error

Solution code:
if input().isupper == true:
  print("A")
else:
  print("a")

Submission status: Runtime Error

Solution code:
C = input()
 
if C.isupeer:
  print("A")
else:
  print("a")

Submission status: Runtime Error

Solution code:
if input().isupeer == True:
  ans = "A"
else:
  ans = "a"
  
print(ans)

Submission status: Runtime Error

Solution code:
C = input()

if C.isupeer == True:
  ans = "A"
else:
  ans = "a"
  
print(ans)

Submission status: Runtime Error

Solution code:
def main():
  s = input()
  ans = 'A' s.isupper() else 'a'
  print(ans)
  
  
  
if __name__ == '__main__':
  main()

Submission status: Runtime Error

Solution code:
N = input()
if N.isupper():
  print('A')
else:
  print(a)

Submission status: Runtime Error

Solution code:
if input().isupper() = True:
    print(A)
else:
    print(a)

Submission status: Runtime Error

Solution code:
α = input()　# 文字列の入力

IF "α".ispper() :
  A
else :
  a

Submission status: Runtime Error

Solution code:
N,K=list(map(int,input().split()))
P=map(int,input().split())
P.sort()
price=0
for i in range(K):
	price+=P[i]
print(price)

Submission status: Runtime Error

Solution code:
N,K=map(int,input().split())
P=list(map(int,input().split()))

P.sort()
price=0
for i in range(K):
  price+=P[i]
  
print(price)

Submission status: Runtime Error

Solution code:
s=input()
if s.isupper(){
  print("A")}else{
  print("a")}

Submission status: Runtime Error

Solution code:
str=str(input())
if str.isupper():
	print("A")
else
	print("a")

Submission status: Runtime Error

Solution code:
a = input()
if 0 <= ord(a) - ord('a') <= 26:
  return 'a'
if 0 <= ord(a) - ord('A') <= 26:
  return 'A'

Submission status: Runtime Error

Solution code:
a = int(input())
if 0 <= ord(a) - ord('a') <= 26:
  return 'a'
if 0 <= ord(a) - ord('A') <= 26:
  return 'A'

Submission status: Runtime Error

Solution code:
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log,gcd
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')

#Pythonを用いる場合
#numpy 1.18.0, scipy 1.4.1, scikit-learn 0.22, numba 0.47.0, networkx 2.4
 
import numpy as np
from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson
from scipy.sparse import csr_matrix

 
#整数input
def ii(): return int(sys.stdin.readline().rstrip()) #int(input())
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) #list(map(int,input().split()))
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]
#文字列input
def ss(): return sys.stdin.readline().rstrip() #input()
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) #list(input().split())
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]

#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？

a=ii()

if 65<= ord(a) <=90:
    print("A")
else:
    print("a")

Submission status: Runtime Error

Solution code:
s = input()

if s.isuppper():
    print("A")
elif s.islower():
    print("a")

Submission status: Runtime Error

Solution code:
a = input()
 print('A' if a.islower() else 'a')

Submission status: Runtime Error

Solution code:
t=str(input())

if 'A'<<t<<'Z':
  print(A)
else:
  print(a)

Submission status: Runtime Error

Solution code:
n, k = input().split(" ")
n = int(n)
k = int(k)
a = [int(x) for x in input().split(" ")]
a.sort()
ans = 0
for i in range(k):
 ans += int(a[i])
print(ans)

Submission status: Runtime Error

Solution code:
a = input()
print('A' a.isupper() else 'a')

Submission status: Runtime Error

Solution code:
b = int(input())
print('A' if b.islower() else 'a')

Submission status: Runtime Error

Solution code:
mozi=str(input())

if A<=mozi<=Z:
  print(A)
else:
  ptint(a)

Submission status: Runtime Error

Solution code:
N = int(input())
alpha = [-1]
alpha.extend([chr(ord('a') + i) for i in range(26)])
q = N
mod = N
ans = ''
while q >= 27:
    q, mod = divmod(q, 26)
    ans = alpha[mod] + ans
if mod != 0:
    ans = alpha[q] + ans
print(ans)

Submission status: Runtime Error

Solution code:
# coding: utf-8
# Your code here!
N=int(input())
A=list(map(int,input().split()))
Q=int(input())
Adic={}
B=0

for i in A:
    Adic[i]=0

for i in A:
    Adic[i]+=1

for i in range(Q):
    b,c=map(int,input().split())
    
    if b not in Adic:
        for k,v in Adic.items():
            B+=k*v
        print(B)
        B=0
    else:
        
        if c in Adic:
            Adic[c]+=Adic[b]
            Adic[b]=0
        elif c not in Adic:
            Adic[c]=0
            Adic[c]+=Adic[b]
            Adic[b]=0
            
        for k,v in Adic.items():
            B+=k*v
        print(B)
        B=0

Submission status: Runtime Error

Solution code:
n,k = map(int,input().split())
p = list(map(int,input().split()))
p.sort()
print(sum(p[:k]))

Submission status: Runtime Error

Solution code:
a = str(input())

if a.islower()==True:
    print(a)
else:
    print(A)

Submission status: Runtime Error

Solution code:
ch = input()
if(ch>='A' && ch <='Z'):
  print('A')
 else:
  print('a')

Submission status: Runtime Error

Solution code:
a=str(input())
if a.islower()==True:
    print(a)
else:
    print(A)

Submission status: Runtime Error

Solution code:
a=str(input())
if a.islower():
    print(a)
else:
    print(A)

Submission status: Runtime Error

Solution code:
a=str(input())
print(string.upper())

Submission status: Runtime Error

Solution code:
f=str(input())
if f.islower == True:
  print(a)
else:
  print(A)

Submission status: Runtime Error

Solution code:
a = input()
if a.upper() == a
    print("A")
else:
    print("a")

Submission status: Runtime Error

Solution code:
st = input()
if(st.is_lower()):
  print('A')
else:
  print('B')

Submission status: Runtime Error

Solution code:
n,k = map(int,input().split())
p = list(int,input())
print(sum(p[:k])

Submission status: Runtime Error

Solution code:
a = input()
if a.isupper():
  print('A')
elif:
  print('a')

Submission status: Runtime Error

Solution code:
x = str(input())

if x.isupper() = True:
  print("A")
else:
  print("a")

Submission status: Runtime Error

Solution code:
x = str(input())
if x.isupper() == Ture:
  print("A")
else:
  print("a")

Submission status: Runtime Error

Solution code:
a = input()
if a.ispper() == True:
    print('A')
else:
    print('a')

Submission status: Runtime Error

Solution code:
a=int(input())

Submission status: Runtime Error

Solution code:
if a.isupper()==True:
    print("A")
else:
    print("a")

Submission status: Runtime Error

Solution code:
x=int(input())
i=0
kekka1=[[0] for _ in range(10)]
while x>0:
    kekka1[i]=x%2
    x=x//2
    i+=1

for k in range(10):
    j=9-k
    if kekka1[j]==1:
        print(str(j)+"番の分銅を右の皿に載せる。")

Submission status: Runtime Error

Solution code:
x=int(input())
i=0
kekka1=[[0] for _ in range(10)]
while x>0:
    kekka1[i]=x%2
    x=x//2
    i+=1

for j in range(10):
    if kekka1[9-j]==1:
        print(str(9-j)+"番の分銅を右の皿に載せる。")

Submission status: Runtime Error

Solution code:
a = input()
 
if True == a.isupper():
  Print("A")
else :
  print("a")

Submission status: Runtime Error

Solution code:
a = input()

if True = a.isupper():
  Print("A")
else :
  print("a")

Submission status: Runtime Error

Solution code:
a = int(input())

if True == a.isupper():
  Print("A")
else :
  print("a")

Submission status: Runtime Error

Solution code:
a = int(input())

if True = a.isupper():
  Print("A")
else :
  print("a")

Submission status: Runtime Error

Solution code:
a = int(input())

if a.isupper() = True:
  Print("A")
else :
  print("a")

Submission status: Runtime Error

Solution code:
c = str(input())

if c.lowercase():
  print('a')
  else:
    print('A')

Submission status: Runtime Error

Solution code:
c = str(input())

if c.lowercase():
  print 'a'
else:
  print 'A'

Submission status: Runtime Error

Solution code:
n = int(input())
n -= 1

alphabet = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']

first = n // len(alphabet)
mod = n % len(alphabet) 

if n < 26:
    print(alphabet[mod])
    
    
elif n >= 26 and n <702:
    print(alphabet[first-1]+alphabet[mod])
    
elif n >= 702 and n <18278:
    second = (first // len(alphabet)) -1
    second_1 = second % len(alphabet)
    print(alphabet[second_1-1]+alphabet[second-1]+alphabet[mod])
    
elif n >= 18278 and n <475254:
    second = (first // len(alphabet)) -1
    second_1 = second % len(alphabet)
    
    third = (second // len(alphabet)) -1 
    third_1 = third % len(alphabet)
    print(alphabet[second_1-1]+alphabet[second-1]+alphabet[mod]+alphabet[mod])
    
elif n >= 475254 and n <1000000000000001:
    print('')

Submission status: Runtime Error

Solution code:
print("Aa"[int(ord(input())>95))

Submission status: Runtime Error

Solution code:
print("Aa"[ord(input())>95)

Submission status: Runtime Error

Solution code:
print("Aa"[ord(input()[0])>95)

Submission status: Runtime Error

Solution code:
print("Aa"[ord(open(0))>95])