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

Solution (Python):
a = input()

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

Solution (Python):
import sys
input=sys.stdin.readline
a=input().rstrip()
b=a.upper()
if a==b:
    print('A')
else:
    print('a')

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

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

Solution (Python):
from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)
from string import ascii_lowercase

s = input()

alpha = ascii_lowercase

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

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

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

Solution (Python):
import re


a = input()

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

Solution (Python):
S = input()

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

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

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

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

Solution (Python):
a = input()
ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"

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

Solution (Python):
N = input()

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

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

Solution (Python):
c=input()
print(['a','A'][ord('A')<=ord(c)<=ord('Z')])

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    a = S()
    if a in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ':
        print("A")
    else:
        print("a")
        return


main()

Solution (Python):
from string import ascii_lowercase

a = input()
if a in ascii_lowercase:
    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):
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

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

def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()


alf1=['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']



alf2=['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']


def main():
  s=S()
  if s in alf1:
    return 'a'
  return 'A'


print(main())

Solution (Python):
import sys, os, math, bisect, itertools, collections, heapq, queue

from decimal import Decimal
from collections import defaultdict



sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)


MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    S = iss()
    print('A' if str.isupper(S) else 'a')


if __name__ == '__main__':
    main()

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

Solution (Python):

import sys

sysread = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10 ** 7)










def run():
    a = input()
    b = a.lower()
    if a == b:
        print('a')
    else:
        print('A')

if __name__ == "__main__":
    run()

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

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

Solution (Python):
from string import ascii_lowercase, ascii_uppercase
lower = set(ascii_lowercase)
upper = set(ascii_uppercase)

s = input()
if s in lower:
    print('a')
else:
    print('A')

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

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

Solution (Python):
a = input()

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

Solution (Python):
a = input()

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

Solution (Python):
S = input()

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

Solution (Python):

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

Solution (Python):

a=input()

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

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left

from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)

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

S = input()

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

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

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

Solution (Python):









def solve():
    alpha = input()

    if alpha.upper() == alpha:
        return 'A'

    return 'a'


def main():
    print(solve())


if __name__ == "__main__":
    main()

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

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

Solution (Python):

import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial
from bisect import bisect_left 
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep='\n')

S = input()
if S[0] == S[0].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):
alpha=input()
if alpha.lower()==alpha:
    print('a')
else:
    print('A')

Solution (Python):
x = input()

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

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

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

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

Solution (Python):

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

Solution (Python):
import sys

import math








input = sys.stdin.readline

getS = lambda: input().strip()
getN = lambda: int(input())
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]

INF = 10 ** 20
MOD = 998244353

def solve():
    s = getS()
    if s.lower() == s:
        print("a")
    else:
        print("A")
def main():
    n = getN()
    for _ in range(n):
        solve()


if __name__ == "__main__":
    
    solve()

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

Solution (Python):
s = input()[0]
if 'a'<=s<='z':
    print('a')
else:
    print('A')

Solution (Python):

def solve(S):
    if S >= 'a':
        return "a"
    else:
        return "A"


if __name__ == "__main__":
    S = input()


    print(solve(S))

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


def main():
    a = readline().rstrip()
    if a.lower() == a:
        print("a")
    else:
        print("A")


if __name__ == '__main__':
    main()

Solution (Python):

import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub


import sys


buff_readline = sys.stdin.readline
readline = sys.stdin.readline

INF = 2**62-1


def read_int():
    return int(buff_readline())


def read_int_n():
    return list(map(int, buff_readline().split()))


def read_float():
    return float(buff_readline())


def read_float_n():
    return list(map(float, buff_readline().split()))


def read_str():
    return readline().strip()


def read_str_n():
    return readline().strip().split()

def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(S):
    return 'A' if S.isupper() else 'a'


def main():
    S = read_str()
    print(slv(S))


if __name__ == '__main__':
    main()

Solution (Python):
a = input()

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

Solution (Python):
def main():
    from sys import setrecursionlimit, stdin, stderr
    from os import environ
    from collections import defaultdict, deque, Counter
    from math import ceil, floor
    from itertools import accumulate, combinations, combinations_with_replacement
    setrecursionlimit(10**6)
    dbg = (lambda *something: stderr.write("\033[92m{}\033[0m".format(str(something)+'\n'))) if 'TERM_PROGRAM' in environ else lambda *x: 0
    input = lambda: stdin.readline().rstrip()
    LMIIS = lambda: list(map(int,input().split()))
    II = lambda: int(input())
    P = 10**9+7
    INF = 10**18+10
    a = input()
    if 0 <= ord(a) - ord('a') <= 25:
        print('a')
    else:
        print('A')
    
main()

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

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

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

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

Solution (Python):

from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
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)


def main():
    s = input()
    print("A" if ord(s) < 95 else "a")


main()

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

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

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

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

Solution (Python):
a = input()

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

Solution (Python):
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
from collections import deque, defaultdict, Counter
from itertools import combinations, permutations, combinations_with_replacement
from itertools import accumulate
from math import ceil, sqrt, pi, radians, sin, cos

MOD = 10 ** 9 + 7
INF = 10 ** 18

S = input()






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

Solution (Python):
a = input()

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

Solution (Python):
n=input()
if n not in "qazwsxedcrfvtgbyhnujmikolp":
    print("A")
else:print("a")

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

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

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

Solution (Python):
s = input()

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

Solution (Python):
a = input()

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

Solution (Python):
import sys
s=sys.stdin.readline()
if(s.lower()==s):
	print("a")
else:
	print("A")

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

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

print("A" if input().rstrip() in "ABCDEFGHIJKLMNOPQRSTUVWXYZ" else "a")

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

Solution (Python):

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

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

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):
a = input()

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

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

Solution (Python):
a = input()

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

Solution (Python):
c = input()

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

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

Solution (Python):
a = input()

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

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

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

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

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

Solution (Python):
import string
S = [chr(i) for i in range(ord("a"),ord("z")+1)]
s = input()
if s in S:
    print("a")
else:
    print("A")

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

if __name__ == '__main__':
    main()

Solution (Python):

def resolve():
    s = input()
    if s.isupper():
        print("A")
    else:
        print("a")
        
if __name__ == "__main__":
    resolve()

Solution (Python):
s = input()

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

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")

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

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

Solution (Python):
import string
print('A' if input() in string.ascii_uppercase else 'a')

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

def ii():
    return int(input())

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

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

Solution (Python):
list_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']
list_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']
s = input()
if s[0] in list_lower:
    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.isupper() else print('a')

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

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

def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
INF = 10 ** 18
MOD = 10**9+7


Ri = lambda : [int(x) for x in sys.stdin.readline().split()]
ri = lambda : sys.stdin.readline().strip()

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

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

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

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

Solution (Python):
from collections import Counter, defaultdict

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

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




S = input()

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

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

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

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

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

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

Solution (Python):
import sys

sys.setrecursionlimit(500005)
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  

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

Solution (Python):
s=input()

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

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

Solution (Python):

from string import ascii_lowercase as c
print("a" if input() in c else "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):
alpha = input()
print("a") if alpha.islower() else print("A")

Solution (Python):


a = input()

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

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

Solution (Python):
from string import ascii_lowercase
s = input()
if s[0] in ascii_lowercase:
    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):
import sys
sys.setrecursionlimit(10**8)
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 li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]





S = input()

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

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

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

Solution (Python):
s = input()

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

Solution (Python):
import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

a = rs()

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

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

Solution (Python):
a = input()

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

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

s = input()[:-1]

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

Solution (Python):
import sys
input = sys.stdin.readline
S = input()[: -1]
if S.isupper(): print("A")
else: print("a")

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

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

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

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

Solution (Python):
s = input()

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

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

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

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

Solution (Python):
import sys 
input = lambda:sys.stdin.readline().strip()
c = input()
if c.isupper():
    print("A")
else:
    print("a")

Solution (Python):
import math
import time
from collections import defaultdict, deque
from sys import stdin, stdout
from bisect import bisect_left, bisect_right
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.islower():
    print("a")
else:
    print("A")

Solution (Python):

s = input()





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

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

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

Solution (Python):
def examA():
    S = SI()
    if S in alphabet:
        ans = "a"
    else:
        ans = "A"
    print(ans)
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

from decimal import getcontext,Decimal as dec
import sys,bisect,itertools,heapq,math,random
from copy import deepcopy
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def I(): return int(input())
def LI(): return list(map(int,sys.stdin.readline().split()))
def DI(): return dec(input())
def LDI(): return list(map(dec,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = dec("0.000000000001")
alphabet = [chr(ord('a') + i) for i in range(26)]
alphabet_convert = {chr(ord('a') + i): i for i in range(26)}

getcontext().prec = 28

sys.setrecursionlimit(10**7)

if __name__ == '__main__':
    examA()

"""
142
12 9 1445 0 1
asd dfg hj o o
aidn
"""

Solution (Python):
"""
N = list(map(int,input().split()))
S = [str(input()) for _ in range(N)]
S = [list(map(int,list(input()))) for _ in range(h)] 
print(*S,sep="")
"""

import sys
sys.setrecursionlimit(10**6)
input = lambda: sys.stdin.readline().rstrip()
inf = float("inf") 

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

Solution (Python):
A = input()

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

Solution (Python):
s = input()

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

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    a = input()

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


if __name__ == '__main__':
    main()

Solution (Python):
a = input()
if('a' <= a <= 'z'): 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):
import sys

import math
import collections

import bisect
import itertools
import fractions

import copy

import decimal

import queue



sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 + 7


ni = lambda: int(sys.stdin.readline())
ns = lambda: map(int, sys.stdin.readline().split())
na = lambda: list(map(int, sys.stdin.readline().split()))



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


if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

Solution (Python):
s = input()

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

Solution (Python):
import string

a = input()

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

Solution (Python):
FAST_IO = 1
if FAST_IO:
    import io, sys, atexit
    rr = iter(sys.stdin.read().splitlines()).next
    sys.stdout = _OUTPUT_BUFFER = io.BytesIO()
    @atexit.register
    def write():
        sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())
else:
    rr = raw_input
rri = lambda: int(rr())
rrm = lambda: map(int, rr().split())
 
s = rr()
if s.isupper():
    print('A')
else:
    print('a')

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

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

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

else:
    print("a")

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

Solution (Python):
import sys
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15

def main():
    A = input()
    if A == A.lower():
        print('a')
    else:
        print('A')
if __name__ == '__main__':
    main()

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

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

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