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: Accepted

Solution code:
from os import pipe


a = input()

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

Submission status: Accepted

Solution code:
print(["A","a"][ord(input())//97])

Submission status: Accepted

Solution code:
import sys
from sys import stdin

str = sys.stdin.readline()

if str.islower():
    print('a')
else:
    print('A')

Submission status: Accepted

Solution code:
S = str(input())

if S.isupper() == True:
	print('A')
else:
	print('a')

Submission status: Accepted

Solution code:
a = input()

if(str.upper(a) == a):
  print("A")
else:
  print("a")

Submission status: Accepted

Solution code:
a = input()

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

else:
    print("a")

Submission status: Accepted

Solution code:
alpha = input()

if alpha.islower():
    print('a')
elif alpha.isupper():
    print('A')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
α=input()
if chr(65)<= α<=chr(90):
    print("A")
elif chr(97)<= α<=chr(122):
    print("a")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
S = input()

if(S.islower()):
    print('a')
else:
    print('A')

Submission status: Accepted

Solution code:
N = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = str(input())
Big = ["Z","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"]
small = ["z","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"]
if a in Big:
    print('A')
else:
    print('a')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
alpha=input()
if 'A' <= alpha <= 'Z':
  print('A')
if 'a' <= alpha <= 'z':
  print('a')

Submission status: Accepted

Solution code:
alps=["z","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"]
a=input()
print("a" if a in alps else "A")

Submission status: Accepted

Solution code:
a = str(input())

if ord(a) < ord ("a"):
    print("A")
else:
    print("a")

Submission status: Accepted

Solution code:
n=input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
# debug = lambda *a, **kw: print(*a, **kw, file=sys.stderr)

s = ins()
assert len(s) == 1


def solve():
    if s.islower():
        return "a"
    else:
        return "A"


print(solve())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import exit
#import copy
#import numpy as np
#from collections import deque

a = input()

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

Submission status: Accepted

Solution code:
s=input()
if(ord(s)>96):
    print("a")
else:
    print("A")

Submission status: Accepted

Solution code:
import numpy as np
import math
import collections
import bisect


def main():
    a = input()

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
val = n.islower()
if val == True:
    print("a")
elif val == False:
    print("A")

Submission status: Accepted

Solution code:
A = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()
if a in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ':
    print('A')
else:
    print('a')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
l = [chr(i) for i in range(97, 97+26)]

if S in l:
  print("a")
else:
  print("A")

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from scipy.sparse.csgraph import floyd_warshall
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations, combinations_with_replacement
from heapq import heappop, heappush, heapify
from fractions import gcd
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

def main():
    a = input()
    n = ord(a)
    if 65 <= n and n <= 65+26:
        print('A')
    else:
        print('a')

    
if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=input()

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

Submission status: Accepted

Solution code:
strr = input()

if strr == "A" or strr =="B" or strr == "C" or strr == "D" or strr =="E" or strr =="F" or strr =="G" or strr =="H" or strr =="I" or strr =="J" or strr =="K" or strr =="L" or strr =="N" or strr =="M" or strr =="O" or strr =="P" or strr =="Q" or strr =="R" or strr =="S" or strr =="T" or strr =="U" or strr =="V" or strr =="W" or strr =="X" or strr =="Y" or strr =="Z":
    print("A")
else:
    print("a")

Submission status: Accepted

Solution code:
alfa = input()
if alfa.isupper() == True:
    print("A")
elif alfa.islower() ==  True:
    print("a")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()
azlist = list('abcdefghijklmnopqrstuvwxyz')
if x in azlist:
  print('a')
else:
  print('A')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

a = read().rstrip().decode()

if a.islower():
    print('a')
else:
    print('A')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input():return sys.stdin.readline()[:-1]
def N(): return int(input())
def NM():return map(int,input().split())
def L():return list(NM())
def LN(n):return [N() for i in range(n)]
def LL(n):return [L() for i in range(n)]
a=input()
if a.upper()==a:
    print("A")
else:
    print("a")

Submission status: Accepted

Solution code:
import numpy as np
x = input()

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
mozi=input()

if mozi.isupper() is True:
  print('A')
else:
  print('a')

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
x = input()

if x.isupper():
    print("A")

else:
    print("a")

Submission status: Accepted

Solution code:
a = input()

if a[0] >= "a":
  print("a")
else:
  print("A")
#

Submission status: Accepted

Solution code:
alpha = input()
ord_a = ord(alpha)

if ord_a < 97:
  print('A')
else :
  print('a')

Submission status: Accepted

Solution code:
def main():
    s = input()
    if s.isupper():
        print("A")
    else:
        print("a")
 
 
if __name__ == '__main__':
    import sys
    sys.setrecursionlimit(10000)
    main()

Submission status: Accepted

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

#solve
def solve():
    a = S()
    if "A" <= a <= "Z":
        print("A")
    else:
        print("a")
    return


#main
if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
A = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=input()
for i in "QWERTYUIOPASDFGHJKLZXCVBNM":
  if(i==n):
    print("A")
for i in "qwertyuiopasdfghjklzxcvbnm":
  if(i==n):
    print("a")

Submission status: Accepted

Solution code:
n = input()

if n.islower():
  print('a')
else:
  print('A')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
alpha = input()
ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
import sys
import re
from collections import deque, defaultdict
from itertools import combinations, combinations_with_replacement
import bisect
from math import factorial, sqrt, log, ceil, floor
sys.setrecursionlimit(1000000)


def main():
    #N, M = map(int, input().split())
    #N, K = map(int, input().split())

    a = input().strip()

    if re.match('[A-Z]', a):
        print('A')
    else:
        print('a')



if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
alpha = input()
if alpha.isupper():
  output = 'A'
else:
  output = 'a'

print(output)

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
x = input()

if ord(x) in list(range(65,92)):
  print('A')
else:
  print('a')

Submission status: Accepted

Solution code:
X = input()

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


def solve():
    a = rl().rstrip()
    if a.isupper():
        print('A')
    else:
        print('a')


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect
import copy
import heapq
import sys
import itertools
import math
import queue
from functools import lru_cache
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 998244353

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]


def main():
    a = input()
    print("a" if a.islower() else "A")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from string import ascii_lowercase, ascii_uppercase
a = input()
if a in ascii_lowercase:
  print("a")
else:
  print("A")

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
readall = sys.stdin.read
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
prn = lambda x: print(*x, sep='\n')

def solve():
    print('A' if ord(ns()) < 97 else 'a')
    return

solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
import string
def main():
    c = input().rstrip()
    if c in string.ascii_lowercase:
        print('a')
    else:
        print('A')
if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

a = readline().rstrip()

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

Submission status: Accepted

Solution code:
try:
    ch = input()
    if(ch >= 'A' and ch <= 'Z'):
        print('A')
    else:
        print('a')
except:
    pass

Submission status: Accepted

Solution code:
a = input()
if 97<=ord(a)<=122:
    print("a")
else:
    print("A")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:

n = input()
a =ord(n)
if a>96:
    print("a")
else:
    print("A")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    alphabet = str(input())
    if alphabet.isupper():
        print('A')
    else:
        print('a')
main()

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    s = input()

    if "a" <= s and s <= "z":
        print("a")
    
    if "A" <= s and s <= "Z":
        print("A")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
Alpha = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpha = "abcdefghijklmnopqrstuvwxyz"
if a in Alpha:
  print("A")
else:
  print("a")

Submission status: Accepted

Solution code:
alphabet="abcdefghijklmnopqrstuvwxyz"
s=input()
if s in alphabet:
    ans='a'
else:
    ans='A'
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()

if a.islower() :
	print("a")

else:
	print("A")

Submission status: Accepted

Solution code:
A=input()
i=['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 i:
  print('a')
else:
  print('A')

Submission status: Accepted

Solution code:
a = input()
if a in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ':
  print('A')
else:
  print('a')

Submission status: Accepted

Solution code:
from heapq import *
import sys
from collections import *
from itertools import *
from decimal import *
import copy
from bisect import *
import math
sys.setrecursionlimit(4100000)
def gcd(a,b):
    if(a%b==0):return(b)
    return (gcd(b,a%b))
input=lambda :sys.stdin.readline().rstrip()

a=input()

if ord(a) in range(ord("a"),ord("z")+1):
    print("a")
else:
    print("A")

Submission status: Accepted

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

s = input()
if("a" <= s and s <= "z"):
    print("a")
elif("A" <= s and s <= "Z"):
    print("A")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S =  ord(input().strip()  ) ;
if S >= ord('A') and S <= ord('Z') :
	print ('A') ;
else : 
	print ('a');

Submission status: Accepted

Solution code:
import re
sletter = re.compile(r'[a-z]')
bletter = re.compile(r'[A-Z]')

xxx = input()

if bletter.match(xxx):
    print('A')
else:
    print('a')

Submission status: Accepted

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

Submission status: Accepted

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

S = input()
if S == S.upper():
    print("A")
elif S == S.lower():
    print("a")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import string

def main():
  alpha = input();

  if alpha in string.ascii_lowercase:
    print("a")
  else:
    print("A")

if __name__ == "__main__":
  main();

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

if a == a.upper(): ans="A"
if a == a.lower(): ans="a"

print(ans)

Submission status: Accepted

Solution code:
x=input()
if x.isupper()==True:
    print("A")
elif x.isupper()==False:
    print("a")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import re
if re.match("[a-z]", input()):
    print("a")
else:
    print("A")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = input()
if('a'<=c<='z'):
  print('a')
else:
  print('A')

Submission status: Accepted

Solution code:
nyu=input()
alpha=list("abcdefghijklmnopqrstuvwxyz")
if nyu in alpha:
    print("a")
else:
    print("A")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = 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']
#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 n in A:
    print('A')
else:
    print('a')

Submission status: Accepted

Solution code:
alpha = input()
if alpha.islower():
  print("a")
elif alpha.isupper():
  print("A")

Submission status: Accepted

Solution code:
import re

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import re

alh = input()

checkinga = re.match(r'[^a-z]', alh)
checkingA = re.match(r'[^A-Z]', alh)

if checkinga == None:
    print('a')
    exit()
else:
    if checkingA == None:
        print('A')
        exit()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
letter=input()

if letter==letter.upper():
    print('A')
else:
    print('a')

Submission status: Accepted

Solution code:
A = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math as mt
#input=sys.stdin.buffer.readline  
#t=int(input())
t=1
for __ in range(t):
    #n,k=map(int,input().split())
    #l=list(map(int,input().split()))
    s=input()
    if ord(s[0])>=97:
        print('a')
    else:
        print('A')

Submission status: Accepted

Solution code:
ch=input()
print('a' if 'a'<=ch<='z' else 'A')

Submission status: Accepted

Solution code:
rf = ord('A')
a = input()
if ord(a)-rf<26:
  print('A')
else:
  print('a')

Submission status: Accepted

Solution code:
alphabet = input()

if alphabet.upper() == alphabet:
    print("A")
else:
    print("a")

Submission status: Accepted

Solution code:

a = input()

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

else:
    print('a')

Submission status: Accepted

Solution code:
a=input()
if ord(a)>=65 and ord(a)<=96:
  print('A')
elif ord(a)>=97 and ord(a)<=122:
  print('a')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = input()

if i.islower() is False:
    print('A')
else:
    print('a')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input().strip()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
letter = input()
if letter.isupper():
  print('A')
else:
  print('a')

Submission status: Accepted

Solution code:
alpha = input()

if alpha.isupper():
  print('A')
elif alpha.islower():
  print('a')

Submission status: Accepted

Solution code:
A = [chr(i) for i in range(65, 65+26)]
a = input()
if a in A:
    print("A")
else:
    print("a")

Submission status: Accepted

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

alpha = input()

if alpha == alpha.upper():
  print("A")
else:
  print("a")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと


def read_a_int(): return int(read())


def read_ints(): return list(map(int, read().split()))


def read_col(H):
    '''H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) #一列の場合'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_tuple(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_matrix(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


MOD = 10**9 + 7
INF = 2**31  # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right
from math import gcd

print('A' if input().isupper() else 'a')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

ua = a == a.upper()

print("A" if ua else "a")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ans = input()

if ans.islower():
  print('a');
if ans.isupper():
  print('A')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

ans = a.isupper()

if ans :
  print('A')
else:
  print('a')

Submission status: Accepted

Solution code:
x = input()
if x.isupper() is True:
  print('A')
if x.islower() is True:
  print('a')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import re
s = input()
t = re.search(r'[a-z]+', s)
if t:
    print("a")
else:
    print("A")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
chaine = input()
if chaine.isupper():
    print("A")
elif chaine.islower():
    print("a")
else:
    print("Boş ver!")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def test(a):
	if a.isupper():
		print('A')
	else:
		print('a')

        
test(input())

Submission status: Accepted

Solution code:
a = input()
if a in "abcdefghijklmnopqrstuvwxynz":
    print("a")
else:
    print("A")

Submission status: Accepted

Solution code:
import sys
import  math
import fractions
from collections import defaultdict
stdin = sys.stdin
     
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))


a=ns()
print('A' if a.isupper() else 'a')

Submission status: Accepted

Solution code:
import string

def resolve():
    a_z = string.ascii_lowercase
    alpha = input()
    if alpha in a_z:
        print("a")
    else:
        print("A")

resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import re
n=input()
m = re.search(r'[A-Z]+', n)
if m==None:
  print("a")
else:
  print("A")

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0

kijun = ord("a")
kijun2 = ord("z")

s = readline().rstrip().decode('utf-8')

if kijun <= ord(s) <= kijun2:
    print("a")
else:
    print("A")

Submission status: Accepted

Solution code:
x = input()

if 'A' <= x <= 'Z': print('A')
else : print('a')