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=raw_input()
if 65<=ord(a)<=90:
    print "A"
else:
    print "a"

Solution (Python):
import numpy as np
import math
a = str(input())
if a.isupper() == True:
    print("A")
else:
    print("a")

Solution (Python):
import sys
input = sys.stdin.readline
def main():
    S = input().rstrip()
    
    c = ord(S)  
    if c  <= 90:
        print('A')
    else:
        print('a')

if __name__ == '__main__':
    main()

Solution (Python):
a = input()

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

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

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

Solution (Python):



import sys
from collections import defaultdict, deque
from heapq import heappush, heappop
import math
import bisect





a = input()

if ord(a) > 90:
    print('a')
else:
    print('A')

Solution (Python):

import re
A = input()

ans = re.match(r"[A-Z]+", A)

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

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

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

Solution (Python):

MOD = 10 ** 9 + 7
INFI = 10**10

import math
from collections import deque
import itertools
import heapq

from fractions import Fraction
import copy
from functools import lru_cache
from collections import defaultdict
import pprint


def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def kingaku(a,b,n):
    keta=len(str(n))
    return a*n+b*keta

def my_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default




def ret(a):
    c=[None]*(len(a)-1)
    if len(a)==1:
        return a[0]
    elif len(a)==0:
        return 0
    for i in range(1,len(a)):
        c[i-1]=abs(a[i]-a[i-1])
    return ret(c)

def soinsubunkai(n):
    a = []
    i = 1
    while i*i <= n:
        if n % i == 0 and i!=1:
            a.append(i)
            n=n//i

        if n% i !=0 or i==1:
            i += 1
    nokori=[n]
    return a + nokori

def main():
    s=input()
    oo=list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
    ko=list("abcdefghijklmnopqrstuvwxyz")
    if s in oo:
        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.isupper():
    print("A")
else:
    print("a")

Solution (Python):
X = input()

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

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

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

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

al = 'abcdefghijklmnopqrstuvwxyz'
a = input()

print("a" if a in al else "A")

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

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

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

Solution (Python):
a = input()

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

Solution (Python):
data = input()

if data.isupper():
    print("A")
elif data.islower():
    print("a")

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

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

Solution (Python):

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

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

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

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

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

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

Solution (Python):
n = input()

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

Solution (Python):
a = input()

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

Solution (Python):
print('aA'[input().isupper()])

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

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

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

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

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

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

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

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

Solution (Python):

a = input()

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

Solution (Python):
A = input()
M = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
m = list("abcdefghijklmnopqrstuvwxyz")
if A in M:
    print("A")
else:
    print("a")

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


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

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

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

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

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

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

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

Solution (Python):
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    A = input()

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


main()

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

Solution (Python):
a = input()

if a.isupper():
    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 = str(input())

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

Solution (Python):

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

Solution (Python):

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

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

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

Solution (Python):

s = input()
if s.isupper():
    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):
a = input()

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

Solution (Python):
import sys
import math
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()
s=input()
if s.isupper():
    print("A")
else:
    print("a")

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

if ord("A") <= ord(S) <= ord("Z"):
    print("A")
else:
    print("a")

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

Solution (Python):
a = input()

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

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

Solution (Python):
s = input()

ans = 0

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

Solution (Python):
alp = input()

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):
a=input()

b=str.lower(a)
c=str.upper(a)

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

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

l = string.ascii_lowercase
u = string.ascii_uppercase

n = input()

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

Solution (Python):
import string
letters = list(string.ascii_lowercase)
print("a" if input() in letters else "A")

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

alpha2num = lambda c: ord(c) - ord('A') + 1

ans = alpha2num(S) 
if ans > 32:
  print("a")
else:
  print("A")

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

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

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

Solution (Python):
str = input()

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

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

Solution (Python):
from sys import stdin

def main():
    xxx = [x for x in stdin.readline().rstrip().split()]
    if str.isupper(xxx[0]):
        print('A')
    else:
        print('a')

if __name__ == "__main__":
    main()

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

Solution (Python):
a=input()

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

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

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

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

def main():
    N = readline().strip()

    n = ord(N)
    low = list(range(97, 97+ 26))

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

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

Solution (Python):
import math

s = input()

su = list("abcdefghijklmnopqrstuvwxyz")

if s in su:
    print("a")
else:
    print("A")

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

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

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

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

Solution (Python):

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

Solution (Python):
s = input()

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

Solution (Python):
x = str(input())
capital_list = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"

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

Solution (Python):








import sys

s = sys.stdin.readline().rstrip()
if "a" <= s and s <= "z":
    print("a")
else:
    print("A")

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

Solution (Python):
a = input()

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

Solution (Python):
import sys
import numpy as np


MODE = 1


DIMENSION = 0


INT_TYPE = 0

if not (MODE):
    with open("input.txt", "r") as f:
        s = f.read()
else:
    s = sys.stdin.read()

if DIMENSION == 0:
    if INT_TYPE == 1:
        s = int(s)
elif DIMENSION == 1:
    if INT_TYPE == 0:
        s = s.split()
    elif INT_TYPE == 1:
        s = [int(x) for x in s.split()]
elif DIMENSION == 2:
    if INT_TYPE == 0:
        s = [x.split() for x in s.splitlines()]
    elif INT_TYPE == 1:
        s = [[int(y) for y in x.split()] for x in s.splitlines()]

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

Solution (Python):
x=input()

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

Solution (Python):


a, = map(str, input().split())

upper = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'

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

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

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

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

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

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

Solution (Python):
a = input()

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

Solution (Python):
s = input()

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

print('a' if ord(a) > ord('Z') else 'A')

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

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

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

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

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

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

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

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

Solution (Python):
x = input()

if x in 'asdfghjklqwertyuiopzxcvbnm':
    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):
a = input()

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

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

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

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

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

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

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

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

Solution (Python):

"""AtCoder Beginner Contest 171: A - αlphabet
https://atcoder.jp/contests/abc17/tasks/abc171_a
"""


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


if __name__ == '__main__':
    main()

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

if __name__ == "__main__":
	main()

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
from decimal import Decimal
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())

a = S()

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

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

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

Solution (Python):
a = input()

upper = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
lower = 'abcdefghijklmnopqrstuvwxyz'

if a in list(upper):
    print('A')
if a in list(lower):
    print('a')

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

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

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

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

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

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

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

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

main()

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

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

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

Solution (Python):
a=input()


if ord(a)>=97:
    print('a')
else:
    print('A')

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

Solution (Python):
alpha = input()

if ord(alpha) > ord('Z'):
    print('a')
else:
    print('A')

Solution (Python):
S = input()
if S == S.lower():
    print('a')
    exit()

else:
    print('A')

Solution (Python):




def input_int():
    return int(input())



def int1(x):
    return int(x) - 1



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



def input_to_int_tuple():
    return tuple(map(int, input().split()))



def input_to_int_tuple_minus1():
    return tuple(map(int1, input().split()))


ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'

def main():
    a = input()

    if ascii_lowercase.count(a) > 0:
        return "a"

    if ascii_uppercase.count(a) > 0:
        return "A"

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

Solution (Python):
s=input()


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

Solution (Python):
import string
L=string.ascii_lowercase
n=input()
if n in L:
    print('a')
else:
    print('A')

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

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

Solution (Python):
a = input()

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

Solution (Python):
x = input()

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

Solution (Python):
inp = input()
small = inp.lower()

if inp == small:
  print("a")
else:
  print("A")

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

Solution (Python):
a = input()
B = a.upper()
b = a.lower()
if a == B:
    print('A')
elif a == b:
    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):
s = input()
if ord(s) >= 65 and ord(s) <= 91:
  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()

b = a.upper()

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

Solution (Python):
import math
import itertools
import collections
import bisect
import heapq

def IN(): return int(input())
def sIN(): return input()
def MAP(): return map(int,input().split())
def LMAP(): return list(map(int,input().split()))
def TATE(n): return [input() for i in range(n)]
MOD = 10**9 + 7

n = input()
l = [chr(i) for i in range(65,91)]

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

Solution (Python):
import sys

input = sys.stdin.readline


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


def str_array():
    return input().strip().split()



n = input().strip()
uppercase = [chr(i) for i in range(65, 65+26)]
lowercase = [chr(i) for i in range(97, 97+26)]
if n in uppercase:
    print("A")
else:
    print("a")

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

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

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

Solution (Python):

import glob
import os

bn = os.path.basename(__file__).split('.')[0]
dn = os.path.dirname(__file__).split('/')


REL_PATH = dn[len(dn)-2] + '\\' + dn[len(dn)-1] + '\\' + bn


TOP_PATH = 'C:\\AtCoder'

class Common:

    problem = []
    index = 0

    def __init__(self, rel_path):
        self.rel_path = rel_path

    def initialize(self, path):
        file = open(path)
        self.problem = file.readlines()
        self.index = 0
        return

    def input_data(self):
        try:
            IS_TEST
            self.index += 1
            return self.problem[self.index-1]

        except NameError:
            return input()

    def resolve(self):
        pass

    def exec_resolve(self):
        try:
            IS_TEST
            for path in glob.glob(TOP_PATH + '\\' + self.rel_path + '/*.txt'):
                print("Test: " + path)
                self.initialize(path)
                self.resolve()
                print("\n\n")
        except NameError:
            self.resolve()


class Solver(Common):

    def resolve(self):

        s = self.input_data()
        if s in "abcdefghijklmnopqrstuvwxyz":
            print("a")
        else:
            print("A")


solver = Solver(REL_PATH)
solver.exec_resolve()

Solution (Python):
import numpy as np
def cumsum(x):
    return list(np.cumsum(x))

def cumsum_number(N,K,x):
    ans=[0]*(N-K+1)
    number_cumsum = cumsum(x)
    number_cumsum.insert(0,0)
    for i in range(N-K+1):
        ans[i]=number_cumsum[i+K]-number_cumsum[i]
    return ans
"""
int 
float 


for name in fruits: 
    print(name)


list0 = [] 
list0 = [1,2,3,4] 
list0 = [0]*10 
list1= [i for i in range(10)] 
list1 = list(map(int, input().split()))　
number=[int(input()) for i in range(int(input()))] 
list1 = list1 + [6, 7, 8] 
list2.append(34) 
list.insert(3,10) 
len(list4) 
max(sa) 
list5.count(2) 
list1.sort() 
list1.sort(reverse=True)  
set(list1) 
sum([2,3,   ,3]) 

abs(a) 
max(a,b) min(a,b) 
text1 = text1.replace("34","test") 
sorted(S) 
exit(0) 

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

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

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

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

Solution (Python):
n = input()

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

Solution (Python):
import sys

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

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

Solution (Python):

from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect

def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def LS(): return [list(x) for x in sys.stdin.readline().split()]


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


def LIR(n):
    return [LI() for i in range(n)]


def SR(n):
    return [S() for i in range(n)]


def LSR(n):
    return [LS() for i in range(n)]


sys.setrecursionlimit(1000000)
mod = 1000000007


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


if __name__ == "__main__":
    solve()

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

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

Solution (Python):
"""
    Satwik_Tiwari ;) .
    20 june , 2020  - Tuesday
"""



from __future__ import division, print_function

from fractions import Fraction
import sys
import os
from io import BytesIO, IOBase


import bisect
from heapq import *
from math import *
from collections import deque
from collections import Counter as counter  
from itertools import combinations as comb 
from itertools import permutations as permutate
from bisect import bisect_left as bl


from bisect import bisect_right as br
from bisect import bisect





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


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)






mod = 1000000007
def inp(): return sys.stdin.readline().rstrip("\r\n") 
def out(var): sys.stdout.write(str(var))  
def lis(): return list(map(int, inp().split()))
def stringlis(): return list(map(str, inp().split()))
def sep(): return map(int, inp().split())
def strsep(): return map(str, inp().split())
def graph(vertex): return [[] for i in range(0,vertex+1)]
def zerolist(n): return [0]*n
def nextline(): out("\n")  
def testcase(t):
    for p in range(t):
        solve()
def printlist(a) :
    for p in range(0,len(a)):
        out(str(a[p]) + ' ')
def lcm(a,b): return (a*b)//gcd(a,b)
def power(a,b):
    ans = 1
    while(b>0):
        if(b%2==1):
            ans*=a
        a*=a
        b//=2
    return ans
def ncr(n,r): return factorial(n)//(factorial(r)*factorial(max(n-r,1)))
def isPrime(n) : 
    if (n <= 1) : return False
    if (n <= 3) : return True
    if (n % 2 == 0 or n % 3 == 0) : return False
    i = 5
    while(i * i <= n) :
        if (n % i == 0 or n % (i + 2) == 0) :
            return False
        i = i + 6
    return True





def solve():
    s = inp()
    string = s
    if(string.isupper()):
        print('A')
    else:
        print('a')


testcase(1)

Solution (Python):

S=input()
S2=S[0]
S2=S2.upper()
if S==S2:
    print("A")
else:
    print("a")

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

Solution (Python):


import sys

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

if __name__ == "__main__":
    main()

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

Solution (Python):


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

temp = S
if temp == S.upper():
    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')

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

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

elif a.islower():
    print('a')

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

Solution (Python):
input_str = input()

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

Solution (Python):
s = input()

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