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



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
    


MOD = 10**9 + 7
INF = 2**31  

from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  
from math import gcd

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

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

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

Solution (Python):
a = input()

ua = a == a.upper()

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

Solution (Python):
x = str(input())
if x.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):
a = input()
if a.isupper():
    print('A')
else:
    print('a')

Solution (Python):
ans = input()

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

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

Solution (Python):
a = input()

ans = a.isupper()

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

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

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

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

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

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

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

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

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

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

        
test(input())

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

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

Solution (Python):
import string

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

resolve()

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

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

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

Solution (Python):
x = input()

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

Solution (Python):
if __name__ == "__main__":
    l = input()
    if l.islower():
      print('a')
    else:
      print('A')

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

Solution (Python):
alphabet = input()

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

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

Solution (Python):
a = input()

if a == a.upper():
  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):
import string
input = str(input())
if input in string.ascii_uppercase:
    print("A")
else:
    print("a")

Solution (Python):
s = input()

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

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

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

Solution (Python):
def main():
    import sys
    read = sys.stdin.buffer.read
    readline = sys.stdin.buffer.readline
    readlines = sys.stdin.buffer.readlines
    sys.setrecursionlimit(10 ** 7)

    s = readline().rstrip().decode()
    if s.isupper():
        print('A')
    else:
        print('a')


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
c = input()

if c in "ABCDEFGHIJKLMNOPQRSTUVWXYZ":
    print("A")
else:
    print("a")

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

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

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

Solution (Python):
alfa = input()

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

Solution (Python):

import sys
sys.setrecursionlimit(300000)

def solve(a):
    if a.lower() == a:
        ret = 'a'
    else:
        ret = 'A'
    print(ret)
    return

def main():
    a = input()
    solve(a)

if __name__ == '__main__':
    main()

Solution (Python):
X = input()

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

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

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

Solution (Python):
d={'a': 1, 'b': 2, 'c': 3, 'd': 4, 'e': 5, 'f': 6, 'g': 7, 'h': 8, 'i': 9, 'j': 10, \
   'k': 11, 'l': 12, 'm': 13, 'n': 14, 'o': 15, 'p': 16, 'q': 17, 'r': 18, 's': 19, \
   't': 20, 'u': 21, 'v': 22, 'w': 23, 'x': 24, 'y': 25, 'z': 26, \
   'A': 27, 'B': 27, 'C': 27, 'D': 27, 'E': 27, 'F': 27, 'G': 27, 'H': 27, 'I': 27, 'J': 27, \
   'K': 27, 'L': 27, 'M': 127, 'N': 27, 'O': 27, 'P': 27, 'Q': 277, 'R': 27, 'S': 27, \
   'T': 27, 'U': 27, 'V': 227, 'W': 27, 'X': 27, 'Y': 27, 'Z': 227,}
a=input()
if 1<=d[a]<=26:
    print("a")
else:
    print("A")

Solution (Python):
A='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
a='abcdefghijklmnopqrstuvwxyz'

n=input()

if n in A:
    print("A")

if n in a:
    print("a")

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

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

Solution (Python):
a=input()

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

Solution (Python):
import sys

import re

def L(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI():return list(map(int,sys.stdin.readline().rstrip().split()))
def LS():return list(sys.stdin.readline().rstrip().split())

def solver(a):
    m = re.findall("[a-z]", a)
    if len(m)==0:
        print('A')
    else:
        print('a')

def main():
    a = L()
    

    solver(a)

if __name__ == '__main__':
    main()

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

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

def solve(alphabet):
    res = ""
    if ord(alphabet) >= 97:
        
        res = "a"
    else:
        res = "A"
    return res
print(solve(alphabet))

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

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

Solution (Python):
import string

A = input()

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

Solution (Python):
a = input()
S = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
s = "abcdefghijklmnopqrstuvwxyz"

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

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

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):
l=['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']
s=str(input())
if s in l:
  print('a')
else:
  print('A')

Solution (Python):
import re

s = input()
m = re.match(r'[a-z]', s)


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

Solution (Python):
import re
s = input()

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

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

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

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

Solution (Python):
alpha = input()

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

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

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

n = input()

if n in data_a:
  print('A')

else:
  print('a')

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

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

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

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

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

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

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

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

Solution (Python):
input_line = input()

if input_line.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.islower() == True):
  print('a')
else:
  print('A')

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

Solution (Python):
X = input()

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

Solution (Python):
import re

a = input()
if (re.search(r'[A-Z]', a)):
    print('A')
else:
    print('a')

Solution (Python):


str=input()
if str.isupper():
    print("A")

else:print("a")

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

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

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

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

Solution (Python):
a = input()

na = ord(a)

if na >= ord('a') and na <= ord('z'):
    print('a')
else:
    print('A')

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):
a = input()

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

Solution (Python):
s = 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()
print('A' if ord('A') <= ord(a) <= ord('Z') else '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):
var = input()


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

Solution (Python):
str = input()

if 'A' <= str[0] and str[0] <= 'Z':
    print('A')
else:
    print('a')

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

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

Solution (Python):
input_line=input()
ord_s = ord(input_line)
if ord_s<91 and ord_s>64:
    print("A")
elif ord_s<123 and ord_s>96:
    print("a")

Solution (Python):
def main():
    x = input()
 
    if x.isupper():
        print('A')
        return
    if x.islower():
        print('a')
        return

main()

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

Solution (Python):
a=input()

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

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

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

Solution (Python):
a = input()

s=int(ord(a))

if  65<=s and s<=90:
 print("A")
elif 97<=s and s<=122:
 print("a")

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

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

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

Solution (Python):
import sys

if __name__ == '__main__':
    a = sys.stdin.readline().rstrip()
    if a.isupper():
        print('A')
    else:
        print('a')

Solution (Python):
import re

alpha = input()

bl_re = re.match('[A-Z]', alpha)

if bl_re == None:
    print ('a')
else:
    print ('A')

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

Solution (Python):
s = ord(input())

a = range(ord('a'), ord('z') + 1)

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

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

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

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

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

Solution (Python):
S = input() 

if S.isupper():
  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']
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):
s = [input() for i in range(1)] 
s0 = s[0]
if s0.isupper() == True:
    print("A")
if s0.islower() == True:
    print("a")

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

Solution (Python):
n = input()

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

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

Solution (Python):
def main():
    a = input()

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


if __name__ == '__main__':
    main()

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

Solution (Python):
from sys import stdin




def ii(): return int(stdin.readline())
def fi(): return float(stdin.readline())
def mi(): return map(int, stdin.readline().split())
def fmi(): return map(float, stdin.readline().split())
def li(): return list(mi())
def si(): return stdin.readline().rstrip()
def lsi(): return list(si())

res=['Yes', 'No']



test_case=1
while test_case:
    test_case-=1

    a=si()
    f=0
    if a<='Z':
        f=1
    print(['a', 'A'][f])

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

Solution (Python):
x = input()

ans = x.islower()


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

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

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

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

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

Solution (Python):




x = input()
str_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".split(',')

if x in str_list:
        print("a")
else:
        print("A")

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

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

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

Solution (Python):
alpha = input()

upper = ["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']
lower = ['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 upper:
    print("A")
else:
    print("a")

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

Solution (Python):


import re

s = input()

pattern = r'[a-z]'

if re.match(pattern, s):
    print('a')
else:
    print('A')

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

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

Solution (Python):
import re
text = input()
small = re.match(r'[a-z]', text)
large = re.match(r'[A-Z]', text)

if small is not None:
    print("a")
if large is not None:
    print("A")

Solution (Python):
alpha = str(input())
if alpha.isupper():
    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):
A=input()
l=["A","a","B","b","C","c","D","d","E","e","F","f","G","g","H","h","I","i","J","j","K",
   "k","L","l","M","m","N","n","O","o","P","p","Q","q","R","r","S","s","T","t","U","u",
   "V","v","W","w","X","x","Y","y","Z","z"]
for i in range(len(l)):
    if A==l[i]:
        if i%2==0:
            print("A")
        else:
            print("a")
        break

Solution (Python):
a=input()
if 'abcdefghijklmnopqrstuvwxyz'.find(a)!=-1:
    print ('a')
    exit()

if 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'.find(a)!=-1:
    print('A')

Solution (Python):

import sys

char = input()

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

Solution (Python):
a = input()

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

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

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

    str_ = input()

    lower = str_.lower()

    if lower == str_:
        print("a")
    else:
        print("A")

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

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

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

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

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

Solution (Python):
import re

a = input()
p = re.compile('[a-z]')
r = p.match(a)
print('a' if r else 'A')

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

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

Solution (Python):
a = input()
x = a.isupper()

if x != 0 :
  print("A")
else:
  print("a")

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

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

Solution (Python):

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

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

Solution (Python):
print('a' if input().islower() else '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()
 
if a.isupper() == True and a.isalpha() == True:
  print("A")
elif a.islower() == True and a.isalpha() == True:
  print("a")

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

Solution (Python):
n = str(input())
dai = ["Q","W","E","R","T","Y","U","I","O","P","A","S","D","F","G","H","J","K","L","Z","X","C","V","B","N","M"]
syou = ["q","w","e","r","t","y","u","i","o","p","a","s","d","f","g","h","j","k","l","z","x","c","v","b","n","m"]
if n in dai:
  print('A')
else:
  print('a')

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

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

a_set = {"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_set:
    print("A")
else:
    print("a")

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

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

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

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

Solution (Python):
import string

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

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

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

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

Solution (Python):
print('Aa'[ord(input())>96])

Solution (Python):
import sys

print("A" if sys.stdin.readline().isupper() else "a")

Solution (Python):
n = input()

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

Solution (Python):

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

Solution (Python):
n=input()
if ord(n)>96:
  print('a')
else:
  print('A')

Solution (Python):
N = input()

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

Solution (Python):
x=input()
P=["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 x in P:
  print("a")
else:
  print("A")

Solution (Python):
line = input()

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

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

Solution (Python):
s = input()

t = s

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

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

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

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

Solution (Python):
i = input()
if 65 <= ord(i) <= 90 :
     print("A")
else :
    print("a")

Solution (Python):
a = input()

if a >= 'a' and a <= 'z':
  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):
str = input()
if str.islower():
  print('a')
else:
  print('A')

Solution (Python):
a=input()
ans=ord(a)
if ans>=96:
	print('a')
else:
	print('A')

Solution (Python):
a=input()

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

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

Solution (Python):
a = str(input())
if ord(a) >= 65 and ord(a) <= 90:
  print("A")
else:
  print("a")

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

Solution (Python):
import re
if re.match(r'[A-Z]',input()):
  print('A')
else:
  print('a')

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

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

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

Solution (Python):
alp = "zabcdefghijklmnopqrstuvwxyz"
a = input()

if a in  alp:
    print ("a")
else:
    print ("A")

Solution (Python):
a=input()
if 'A'<=a<='Z':
  print("A")
else:
  print("a")

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

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

Solution (Python):

print('A' if ord(input())<= 90 else 'a')

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

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

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

Solution (Python):
a = input()

oomozi = ["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"]
komozi = ["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 oomozi:
    print("A")
elif a in komozi:
    print("a")

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

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

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

Solution (Python):
str = input()

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

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

Solution (Python):

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

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

Solution (Python):
x = input()
if ord(x) > 64 and ord(x) < 91:
  print('A')
elif ord(x) > 96 and ord(x) < 123:
  print('a')

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

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

Solution (Python):
a = input()
b = ord(a)

if b <= 90 and b >= 65:
  print('A')
else:
  print('a')

Solution (Python):
import string
inputs = input()
cnt = 0
for i in range(26):
  if inputs == string.ascii_uppercase[i]:
    cnt = 1
    break
              
if cnt == 0:
  print("a")
else:
  print("A")

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

if __name__ == '__main__':
    main()

Solution (Python):
import os
import sys
from io import BytesIO, IOBase


def main():
    s=input()

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





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)
input = lambda: sys.stdin.readline().rstrip("\r\n")



if __name__ == "__main__":
    main()