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 .

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

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

Solution (Python):
A = input()

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

Solution (Python):
a = input()
if ord(a) >= 97:
    print("a")
else:
    print("A")

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

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

Solution (Python):
S = input()

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

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

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

Solution (Python):
a = input()

if ord(a)>95:
    print("a")
else:
    print("A")

Solution (Python):
import string
a = input()

if string.ascii_uppercase.count(a) == 1:
    print('A')
else:
    print('a')

Solution (Python):

charz = input().rstrip(('\n'))

if ord(charz) < ord('a'):
    print('A')
else:
    print('a')

Solution (Python):

a = input()

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

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

Solution (Python):
def main():
  a = str(input())
  if a.islower():
    print("a")
  else:
    print("A")
    
if __name__ == "__main__":
  main()

Solution (Python):
moji =input()

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

Solution (Python):
import re

def main():
    alpha = input()
    if re.search('[a-z]', alpha):
        print('a')
    else:
        print('A')
    
if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
x = input()

if x >= "A" and x <= "Z":
  print("A")
elif x >= "a" and x <= "z":
  print("a")
else:
  pass

Solution (Python):
alpha=str(input())
check=alpha.isupper()

if check==True:
    print("A")
else:
    print("a")

Solution (Python):
a = input ()

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

Solution (Python):



def main():
    asc = ord(input())
    if 65 <= asc <= 90:
        print("A")
    else:
        print("a")


if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):
import string




n = input()


if n in string.ascii_lowercase:
  print("a")
elif n in string.ascii_uppercase:
  print("A")

Solution (Python):
alpha = str(input())
print("A" if alpha.isupper() else "a" if alpha.islower() else "")

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

Solution (Python):
a = input()

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

Solution (Python):
alphabet=input()

for i in alphabet:
    i=i.isupper()
    if(i==1):
        print('A')
    else:
        print('a')

Solution (Python):
ch = input(" ")[0]
if ch.isupper() :
    print("A")

elif ch.islower() :
    print("a")

Solution (Python):



def main():
    s = input()
    if s 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')


if __name__ == "__main__":
    main()

Solution (Python):
n = str(input())

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

Solution (Python):
def check(ch): 
  
    if (ch >= 'A' and ch <= 'Z'):
        print("A")
  
    if (ch >= 'a' and ch <= 'z'): 
        print("a")  
  
ch = input() 
check(ch)

Solution (Python):
i=str(input())
big="ABCDEFGHIJKLMNOPQRSTUVWXYZ"
if i in big:
  print("A")
else:
  print("a")

Solution (Python):
a = input()

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

Solution (Python):
N = input()
L=[chr(ord('a') + i) for i in range(26)]
if str(N) in L:
  print('a')
else:
  print('A')

Solution (Python):
userInput = input()

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

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

Solution (Python):

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

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

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

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

Solution (Python):
α = input()
if α.isupper() == True:
  print ('A')
else:
  print ('a')

Solution (Python):
letter= input()
if letter>'Z':
  print('a')
else:
  print('A')

Solution (Python):
a = input()

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

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

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

Solution (Python):
a = input()
if a.islower():
    print("a")
if a.isupper():
    print("A")

Solution (Python):
import sys
input = sys.stdin.readline

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

Solution (Python):
alpha = input()

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

Solution (Python):

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

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

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

Solution (Python):
char = input()

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

Solution (Python):
S = input()


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

Solution (Python):
N=input()
M=N.upper()
if N == M:
    print("A")
else:
    print("a")

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

Solution (Python):
from os import pipe


a = input()

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

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

Solution (Python):
import sys
from sys import stdin

str = sys.stdin.readline()

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

Solution (Python):
S = str(input())

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

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

Solution (Python):
a = input()

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

Solution (Python):
a = input()

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

else:
    print("a")

Solution (Python):
alpha = input()

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

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

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

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

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

Solution (Python):

S = input()

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

Solution (Python):
N = str(input())

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

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

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

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

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

Solution (Python):
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')

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

Solution (Python):
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')

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

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

Solution (Python):
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")

Solution (Python):
a = str(input())

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

Solution (Python):
print('Aa'[input().islower()])

Solution (Python):
n=input()

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

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

Solution (Python):
n = input()

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

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

Solution (Python):
a=str(input())

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

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

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

Solution (Python):
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()


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


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


print(solve())

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

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

Solution (Python):
from sys import exit




a = input()

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

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

Solution (Python):
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()

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

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

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

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

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

Solution (Python):
A = input()

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

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

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

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

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

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

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

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

Solution (Python):
s = input()

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

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

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

Solution (Python):
import sys, bisect, math, itertools, string, queue, copy



from collections import Counter,defaultdict,deque
from itertools import permutations, combinations, combinations_with_replacement
from heapq import heappop, heappush, heapify
from fractions import gcd

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()

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

Solution (Python):
x=input()

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

Solution (Python):
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")

Solution (Python):
S = input()

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

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

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

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

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

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

Solution (Python):
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')

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

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

Solution (Python):
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")

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

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

Solution (Python):
s = input()

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

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

Solution (Python):
a = input()

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

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

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

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

Solution (Python):
mozi=input()

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

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

Solution (Python):
S = input()

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

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

Solution (Python):
s = input()

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

Solution (Python):
x = input()

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

else:
    print("a")

Solution (Python):
a = input()

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

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

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

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

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

Solution (Python):

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')


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



if __name__ == '__main__':
    solve()

Solution (Python):
A = input()

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

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

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

Solution (Python):
n = input()

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

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

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

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

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

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

Solution (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():
    
    

    a = input().strip()

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



if __name__ == '__main__':
    main()

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

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

print(output)

Solution (Python):
s = input()

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

Solution (Python):
a = input()

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

Solution (Python):
x = input()

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

Solution (Python):
X = input()

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

Solution (Python):
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()

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

Solution (Python):
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()

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

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

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

Solution (Python):
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()

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

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

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

Solution (Python):
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()

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

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

Solution (Python):
a = input()

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

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

if __name__ == "__main__":
    main()

Solution (Python):
import sys
readline=sys.stdin.readline

a = readline().rstrip()

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

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

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

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

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

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

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

Solution (Python):
a = input()

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

Solution (Python):
s = input()

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

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

Solution (Python):

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

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

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

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

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

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

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

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

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

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

Solution (Python):
a=input()

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

else:
	print("A")

Solution (Python):
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')

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

Solution (Python):
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")

Solution (Python):

 

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

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

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

Solution (Python):
a=input()

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

Solution (Python):
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')

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

Solution (Python):


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

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

Solution (Python):
import string

def main():
  alpha = input();

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

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

Solution (Python):
a = input()

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

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

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

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

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

Solution (Python):
a = input()

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

print(ans)

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

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

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

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

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

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

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

Solution (Python):
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']

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

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

Solution (Python):
import re

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

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

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

Solution (Python):
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()

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

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

Solution (Python):
letter=input()

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

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

Solution (Python):
A = input()

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

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

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

Solution (Python):
import sys
import math as mt


t=1
for __ in range(t):
    
    
    s=input()
    if ord(s[0])>=97:
        print('a')
    else:
        print('A')

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

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

Solution (Python):
alphabet = input()

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

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

Solution (Python):

a = input()

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

else:
    print('a')

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

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

Solution (Python):
i = input()

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

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

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

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

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

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

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

Solution (Python):

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

Solution (Python):
alpha = input()

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

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

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

Solution (Python):


alpha = input()

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

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

Solution (Python):
N = input()

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