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

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

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

Solution (Python):
import string


if input() in string.ascii_uppercase:
    print("A")
else:
    print("a")

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

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

Solution (Python):
a = input()

b = a.upper()

print("A") if a==b else print("a")

Solution (Python):
import sys
input=lambda: sys.stdin.readline().rstrip()
S=input()
if ord(S)>=97:
  print("a")
else:
  print("A")

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

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

Solution (Python):
import re
def main():
    inp = input()
    if re.match(f'[A-Z]',inp):
        print("A")
    else:
        print("a")
    return 

if __name__ == "__main__":
    main()

Solution (Python):
n=input()
hoge="abcdefghijklmnopqrstuvwxyz"
huga="ABCDEFGHIJKLMNOPQRSTUVWXYZ"
if(n in hoge):
  print("a")
if(n in huga):
  print("A")

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

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

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

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

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
 
def main():
    s = input()
    x = ord(s)
    if (ord('A') <= x) and (x <= ord('Z')):
        print('A')
    else:
        print('a')
if __name__ == '__main__':
    main()

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):
s = input()
print("a" if ord(s) >= ord("a") else "A")

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

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

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

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

Solution (Python):
c = input()

if ord(c) >= ord('a') and ord(c) <= ord('z'):
  print('a')
elif ord(c) >= ord('A') and ord(c) <= ord('Z'):
  print('A')

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

if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

Solution (Python):
n = input()
dic = {'A':0,'B':1,'C':2,'D':3,'E':4,'F':5,'G':6,'H':7,'I':8,'J':9,'K':10,'L':11,'M':12,\
       'N':13,'O':14,'P':15,'Q':16,'R':17,'S':18,'T':19,'U':20,'V':21,'W':22,'X':23,'Y':24,'Z':25}
if n in dic:
  print('A')
else:
  print('a')

Solution (Python):
a = input()

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

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

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

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

Solution (Python):
a = input()

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

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

if __name__ == "__main__":
    main()

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

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

Solution (Python):
a = input()
b = a.upper()

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

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

Solution (Python):
A = input()

alf = [
    '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 alf:
    print('A')
else:
    print('a')

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

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

Solution (Python):
a = input()

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

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

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

if __name__=='__main__':
    main()

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

Solution (Python):
import math
from collections import Counter

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

Solution (Python):
a = input()

if ord(a) - ord('A') <=26:
    print('A')
else:
    print('a')

Solution (Python):




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

def test():
    import doctest
    doctest.testmod()

if __name__ == '__main__':
    
    main()

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

Solution (Python):
import numpy as np
import scipy.sparse as sps
import scipy.misc as spm
import collections as col
import functools as func
import itertools as ite
import fractions as frac
import math as ma
from math import cos,sin,tan,sqrt
import cmath as cma
import copy as cp
import sys
import re
import bisect as bs
sys.setrecursionlimit(10**7)
EPS = sys.float_info.epsilon
PI = np.pi; EXP = np.e; INF = np.inf
MOD = 10**9 + 7

def sinput(): return sys.stdin.readline().strip()
def iinput(): return int(sinput())
def imap(): return map(int, sinput().split())
def fmap(): return map(float, sinput().split())
def iarr(n=0):
    if n: return [0 for _ in range(n)]
    else: return list(imap())
def farr(): return list(fmap())
def sarr(n=0):
    if n: return ["" for _ in range(n)]
    else: return sinput().split()
def barr(n): return [False for _ in range(n)]
def adj(n): return [[] for _ in range(n)]

s = sinput()
ans = "A" if s.isupper() else "a"
print(ans)

Solution (Python):
alpha = input()

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

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

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


if __name__ == "__main__":
    main()

Solution (Python):
a = input()
a_1 = 'abcdefghijllmnopqrstuvwxyz'
A_1 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
if a in a_1:
  print('a')
elif a in A_1:
  print('A')

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

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

Solution (Python):

s=input()
if s.isupper():
    print('A')
elif s.islower():
    print('a')

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

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

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

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):
s = input()

if 65 <= ord(s) and ord(s) <= 90:
    print('A')
else:
    print('a')

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

Solution (Python):
a = input()

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

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

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

Solution (Python):
a = input()

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

Solution (Python):
a = input()
if a.upper() == a:
    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()

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

Solution (Python):
def main():
    s = input()
    alphabets = [chr(ord("a") + x) for x in range(26)]
    if s in alphabets:
        print("a")
    else:
        print("A")


if __name__ == "__main__":
    main()

Solution (Python):


import sys
import math
import time

import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools










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

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

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

resolve()

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

Solution (Python):
s = input()

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

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

Solution (Python):
x=input()
if x.isupper():
    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):
alpha = input()

if alpha.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()
if a.isupper():
  print('A')
else:
  print('a')

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

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

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

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

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

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

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



if __name__ == '__main__':
    main()

Solution (Python):
A = input()
li = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**9)

def main():
    n = input()

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


if __name__ == "__main__":
    main()
    sys.exit(0)

Solution (Python):
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): 
	return list(map(int,input().split()))
def m(): 
	return map(int,input().split())
def onem(): 
	return int(input())
def s(x): 
	a = []
	if len(x) == 0:
		return []
	aa = x[0]
	su = 1
	for i in range(len(x)-1):
		if aa != x[i+1]:
			a.append([aa,su])
			aa = x[i+1]
			su = 1
		else:
			su += 1
	a.append([aa,su])
	return a
def jo(x): 
	return " ".join(map(str,x))
def max2(x): 
	return max(map(max,x))
def In(x,a): 
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
	ll = 0
	rr = r
	while True:
		mid = (ll+rr)//2

	if rr == mid:
		return ll
	if (ここに評価入れる):
		rr = mid
	else:
		ll = mid+1
"""

s = input()[:-1]

po = ord(s) - 97

if po < 0:
	print("A")
else:
	print("a")

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



    

 
    
    
if __name__ == "__main__":
    main()

Solution (Python):
if input() in [chr(i) for i in range(65, 65+26)]:
  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.isupper()):
  print('A')
else:
  print('a')

Solution (Python):
t = input()

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

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

Solution (Python):
line = input()

if (line.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:
    print('A')
else:
    print('a')

Solution (Python):
alpha = input()

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

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

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

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

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

Solution (Python):


c = input()

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

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

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

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

Solution (Python):
temp = input()

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

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

Solution (Python):
a = input()

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

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

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

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

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

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

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

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

Solution (Python):
S = input()

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

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

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

Solution (Python):
c = input()

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

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

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

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

Solution (Python):
s=input()
if(ord(s[0])>=65 and ord(s[0])<97):
  print('A')
else:
  print('a')

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

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

Solution (Python):
a = input()

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

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    c=SI()
    if ord(c)>=97:print("a")
    else:print("A")

main()

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

Solution (Python):
import string

L = string.ascii_uppercase

s = input()
f = s in L

print(['a', 'A'][f])

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

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

Solution (Python):
A = input()

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

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

Solution (Python):
import sys
import numpy as np
import math  
from collections import deque
from collections import defaultdict
from copy import deepcopy
from itertools import accumulate 
def input(): return sys.stdin.readline().rstrip()
from functools import lru_cache 

def main():
    s = input()
    if s.isupper():
        print('A')
    else: print('a')
    
    return 0

if __name__ == "__main__":
    main()

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

Solution (Python):




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

    

if __name__ == '__main__':
    main()

Solution (Python):
a=input()

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

Solution (Python):
s=input()

t=s.upper()

if s==t:
  print("A")
else:
  print("a")

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

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

Solution (Python):
import sys
import math
import collections
import decimal
import itertools
from collections import deque
from functools import reduce
import heapq


s = input()


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

Solution (Python):
def main():
    from builtins import int, str, map, list, print
    import sys
    sys.setrecursionlimit(10 ** 6)

    input = (lambda: (sys.stdin.readline()).rstrip())
    input_list = (lambda: input().split())
    input_number = (lambda: int(input()))
    input_number_list = (lambda: list(map(int, input_list())))

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


if __name__ == '__main__':
    main()

Solution (Python):
print('A' if input().isupper() 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):
s=str(input())
if(ord(s[0])>=65 and ord(s[0])<97):
  print("A")
else:
  print("a")

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
from math import floor, sqrt, factorial, hypot, log  
from heapq import heappop, heappush, heappushpop
from collections import Counter, defaultdict, deque
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement
from bisect import bisect_left, bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint


def ceil(a, b): return (a + b - 1) // b


inf = float('inf')
mod = 10 ** 9 + 7


def pprint(*A):
    for a in A:     print(*a, sep='\n')


def INT_(n): return int(n) - 1


def MI(): return map(int, input().split())


def MF(): return map(float, input().split())


def MI_(): return map(INT_, input().split())


def LI(): return list(MI())


def LI_(): return [int(x) - 1 for x in input().split()]


def LF(): return list(MF())


def LIN(n: int): return [I() for _ in range(n)]


def LLIN(n: int): return [LI() for _ in range(n)]


def LLIN_(n: int): return [LI_() for _ in range(n)]


def LLI(): return [list(map(int, l.split())) for l in input()]


def I(): return int(input())


def F(): return float(input())


def ST(): return input().replace('\n', '')


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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
a = input()

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

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

Solution (Python):


import sys
import numpy as np
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

S = readline().decode().rstrip()

print("A") if S.isupper() 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):
N=input()

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

Solution (Python):
a = input()
if a.isupper():
    print('A')
elif a.islower():
    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):
alpha = input()
if ord(alpha) <= 90:
    print('A')
else:
    print('a')

Solution (Python):


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


def solve():
    a = input().strip()
    if a.isupper():
        return 'A'
    return 'a'


if __name__ == '__main__':
    print(solve())

Solution (Python):
a = input()

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

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

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

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

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

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

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

Solution (Python):
x=input()
A="ABCDEFGHIJKLMNOPQRSTUVWXYZ"
a="abcdefghijklmnopqrstuvwxyz"
if x in A:
  print("A")
if x in a:
  print("a")

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

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

Solution (Python):
X = input()

if X.isupper() == True:
    print('A')

else:
    print('a')

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

a = input().rstrip('\n')
if a.upper()==a:
  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):
a = input()
if a in 'ABCDEFGFIJKLMNOPQRSTUVWXYZ':
    print('A')
else:
    print('a')

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

Solution (Python):
a = input()

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

else:
    print('a')

Solution (Python):
import sys, collections, bisect, itertools, heapq, math, copy, string
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    S = SS()

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

if __name__ == '__main__':
    resolve()

Solution (Python):
if input().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():
	print("A")
else:
	print("a")

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

Solution (Python):
print(['a', 'A'][input().isupper()])

Solution (Python):
Q = input()

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

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

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

Solution (Python):
a = input()

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

Solution (Python):


import sys
iim = lambda: map(int, sys.stdin.readline().rstrip().split())

def resolve():
    s = input()
    print("A" if "A" <= s <= "Z" else "a")

if __name__ == "__main__":
    resolve()

Solution (Python):

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

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

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

Solution (Python):

import collections
import itertools as it
import math

 
s  = input()







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

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

Solution (Python):
x = str(input())
if ord('A') <= ord(x) <= ord('Z'):
    print('A')
else:
    print('a')

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

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

Solution (Python):
a = input()

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

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

Solution (Python):
from copy import deepcopy
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions
from operator import itemgetter
import itertools
import copy


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


def gcd(a, b):
    while(b != 0):
        a, b = b, a % b
    return a



dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]


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

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

Solution (Python):
a = input()

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

Solution (Python):
x = ord(input())
if x >= 97:
    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():
    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:
  print("A")
else:
  print("a")

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

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

Solution (Python):
a = input()

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

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

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

Solution (Python):
n = input()

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

Solution (Python):
alpha=input()

A=ord("A")
Z=ord("Z")

a=ord(alpha)
if a>=A and a<=Z:
    print("A")
else:
    print("a")

Solution (Python):
"""
    こんにちは。これはクシャルです
    
    Author : thekushalghosh (クシャル)
    Team   : CodeDiggers
 
    I prefer Python language over the C++ language :p :D
        
    Visit my website : thekushalghosh.github.io
"""
import sys,math,cmath,time
start_time = time.time()



def solve():
    c = insr()
    if "A" <= c <= "Z":
        print("A")
    else:
        print("a")
            


 
def main():
    global tt
    if not ONLINE_JUDGE:
        sys.stdin = open("input.txt","r")
        sys.stdout = open("output.txt","w")
    t = 1
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        print("Time Elapsed :",time.time() - start_time,"seconds")
        sys.stdout.close()
    

def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    return(input().strip())
def invr():
    return(map(int,input().split()))
 

def counter(a):
    q = [0] * (max(a) + 1)
    for i in range(len(a)):
        q[a[i]] = q[a[i]] + 1
    return(q)
 
def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1
    return(q)


        
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
    
    
main()

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

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

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

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

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

if __name__ == '__main__':
    main()

Solution (Python):
S = input()

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

Solution (Python):
import sys



if(__name__ == "__main__"):

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

Solution (Python):
c = input()

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

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

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

Solution (Python):
s=input()

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

Solution (Python):
a=input()

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

Solution (Python):
s = input()

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