Problem:
 Score : 100 points    Problem Statement An uppercase or lowercase English letter \alpha will be given as input.
If \alpha is uppercase, print A ; if it is lowercase, print a .      Constraints  \alpha is an uppercase ( A - Z ) or lowercase ( a - z ) English letter.         Input Input is given from Standard Input in the following format:  α       Output If \alpha is uppercase, print A ; if it is lowercase, print a .        Sample Input 1 B      Sample Output 1 A  B is uppercase, so we should print A .       Sample Input 2 a      Sample Output 2 a  a is lowercase, so we should print a .

Solution (Python):
import sys

def input(): return sys.stdin.readline().strip()
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 INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 19
MOD = 10 ** 9 + 7
EPS = 10 ** -10

S = input()

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

Solution (Python):
a = input()

if ord(a) >= ord('a') and ord(a) < ord('a')+26:
    print('a')
else:
    print('A')

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

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

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

Solution (Python):
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
from math import gcd,ceil,floor,factorial

from functools import reduce
from pprint import pprint
from statistics import mean,median,mode

INF = float("inf")

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col,reverse_flag):
    data.sort(key=lambda x:x[col],reverse=reverse_flag)
    return data

def mymax(data):
    M = -1*float("inf")
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float("inf")
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

def mycount(ls,x):
    
    l = bisect_left(ls,x)
    r = bisect_right(ls,x)
    return (r-l)

def myoutput(ls,space=True):
    if space:
        if len(ls)==0:
            print(" ")
        elif type(ls[0])==str:
            print(" ".join(ls))
        elif type(ls[0])==int:
            print(" ".join(map(str,ls)))
        else:
            print("Output Error")
    else:
        if len(ls)==0:
            print("")
        elif type(ls[0])==str:
            print("".join(ls))
        elif type(ls[0])==int:
            print("".join(map(str,ls)))
        else:
            print("Output Error")

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

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

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

def CI(n):
    return [ int(input()) for _ in range(n) ]

def LI(n):
    return [ list(map(int,input().split())) for _ in range(n) ]

def S():
    return input()

def MS():
    return input().split()

def RS():
    return list(input().split())

def CS(n):
    return [ input() for _ in range(n) ]

def LS(n):
    return [ list(input().split()) for _ in range(n) ]

s = S()

al = [ chr(ord('a') + i) for i in range(26) ]


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

Solution (Python):

N = input()

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

else:
    print("a")

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(2 * 10**6)


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


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


if __name__ == '__main__':
    main()

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']
a = input()
if a in alpha:
  print('a')
elif a.lower() in alpha:
  print('A')

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

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

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

Solution (Python):

import string

char = input()

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

Solution (Python):




def main():
    C = input()
    if ord(C)>=ord('A') and ord(C)<=ord('Z'):
        print('A')
    else:
        print('a')

    return

    

if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys
sys.setrecursionlimit(1000000000)
import math
from math import gcd
def lcm(a, b): return a * b // gcd(a, b)
from itertools import count, permutations, chain
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok

def get_inv(n, modp):
    return pow(n, modp-2, modp)

def factorials_list(n, modp):    
    fs = [1]
    for i in range(1, n+1):
        fs.append(fs[-1] * i % modp)
    return fs

def invs_list(n, fs, modp):     
    invs = [get_inv(fs[-1], modp)]
    for i in range(n, 1-1, -1):
        invs.append(invs[-1] * i % modp)
    invs.reverse()
    return invs

def comb(n, k, modp):
    num = 1
    for i in range(n, n-k, -1):
        num = num * i % modp
    den = 1
    for i in range(2, k+1):
        den = den * i % modp
    return num * get_inv(den, modp) % modp

def comb_from_list(n, k, modp, fs, invs):   
    return fs[n] * invs[n-k] * invs[k] % modp



class UnionFindEx:
    def __init__(self, size):
        
        self.roots = [-1] * size
    def getRootID(self, i):
        r = self.roots[i]
        if r < 0:   
            return i
        else:
            r = self.getRootID(r)
            self.roots[i] = r
            return r
    def getGroupSize(self, i):
        return -self.roots[self.getRootID(i)]
    def connect(self, i, j):
        r1, r2 = self.getRootID(i), self.getRootID(j)
        if r1 == r2:
            return False
        if self.getGroupSize(r1) < self.getGroupSize(r2):
            r1, r2 = r2, r1
        self.roots[r1] += self.roots[r2]    
        self.roots[r2] = r1
        return True

Yes = 'Yes'
No = 'No'


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


main()

Solution (Python):
t = input()


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

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

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

Solution (Python):

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

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

Solution (Python):
alpha2num = lambda c: ord(c) - ord('A') + 1
if alpha2num(input())>=33:
  print("a")
else:
  print("A")

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

Solution (Python):
a=input()

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

Solution (Python):
n = input()

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

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

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

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

resolve()

Solution (Python):
s = input()

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

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

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()


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

if __name__ == "__main__":
    main()

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

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

Solution (Python):
a = input()

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

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

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

Solution (Python):
a = input()

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

Solution (Python):
s = input()

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

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

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

Solution (Python):
n = input()

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

Solution (Python):
a = input()

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

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

Solution (Python):
a=input()

if a.isupper():
    ans = "A"
else:
    ans = "a"

print(ans)

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

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

Solution (Python):

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

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

Solution (Python):
upper = "QWERTYUIOPASDFGHJKLZXCVBNM"

A = input()

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

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

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

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

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

Solution (Python):
alpha = input()

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

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

Solution (Python):

alpha = input()

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

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

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

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

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

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

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

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

Solution (Python):
import sys

a = str(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.isupper():
    print("A")
else:
    print("a")

Solution (Python):
a = input()

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

Solution (Python):


import re

def main():
    n = input()
    p = re.compile('[a-z]+')
    if p.fullmatch(n):
        print('a')
    else:
        print('A')

def count_tento(l, cur):
    count = 0
    for v in l:
        if v > cur:
            count += 1
    return count

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

def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

if __name__ == '__main__':
    main()

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

Solution (Python):
c = input()

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

Solution (Python):
S = input()

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

Solution (Python):
from math import gcd

from math import factorial as f

from math import ceil,floor,sqrt
import math

import bisect
import re
import heapq


from copy import deepcopy
import itertools
from itertools import permutations

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))


yes = "Yes"
no = "No"


def main():
    l = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
    x = input()
    if x in l:
        print('a')
    else:
        print('A')

main()

Solution (Python):
a = input()

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

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

Solution (Python):

from sys import stdin
from operator import itemgetter
from collections import deque, Counter
import math
import pprint
from functools import reduce


MOD = 1000000007
INF = float('inf')

def keta(kazu): 
    kazu_str = str(kazu)
    kazu_list = [int(kazu_str[i]) for i in range(0, len(kazu_str))]
    return kazu_list

def gcd(*numbers): 
    return reduce(math.gcd, numbers)

def combination(m,n): 
    
    if n > m:
        return 'すまん'
    return math.factorial(m) // (math.factorial(m-n) * math.factorial(n))

def pow_k(x,n):  
    if n == 0:
        return 1
    K = 1
    while n > 1:
        if n % 2 != 0:
            K *= x
        x *= x
        n //= 2
    return K * x
    
def main():
    s = stdin.readline().rstrip()
    if s.isupper():
        print("A")
    else:
        print("a")
main()

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

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

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

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

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

Solution (Python):




def main():
    
    al = input()
    if al.isupper():
        print("A")
    else:
        print("a")
    return
if __name__ == '__main__':
    main()

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

        if alpha.isupper():
                ans = "A"
        else:
                ans = "a"

        return ans

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

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

Solution (Python):
N=input()

if(str.isupper(N)):
    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):

from sys import stdin
input = stdin.readline

X = str(input().split())

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

else:
    print("a")

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

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

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

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

    if a in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ':
        return 'A'
    else:
        return 'a'


print(solve())

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

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

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

Solution (Python):
a = str(input())
cap = [chr(i) for i in range(97, 97+26)]
CAP = [chr(i) for i in range(65, 65+26)]
if a in CAP:
    print('A')
if a in cap:
    print('a')

Solution (Python):



N = input()

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

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

Solution (Python):
a = input()

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

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

Solution (Python):
def main():
    import sys
    
    s = sys.stdin.readline().rstrip()
    
    A = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
    a = 'abcdefghijklmnopqrstuvwxyz'
    if s in A:
        print('A')
    elif s in a:
        print('a')




if __name__=='__main__':
    main()

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

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

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

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

Solution (Python):
a=input()

w='abcdefghijklmnopqrstuvwxyz'

W='ABCDEFGHIJKLMNOPQRSTUVWXYZ'

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

else:
    print('a')

Solution (Python):
alpha = input()

x = alpha.lower()

if alpha == x:
  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.islower():
    print('a')
elif s.isupper():
    print('A')

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

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

if inp.isupper():
    ans='A'
else:
    ans='a'

print(ans)

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

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

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

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

Solution (Python):
a = input()

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

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

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

Solution (Python):
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]
def input():
    return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
    return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
    return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
  ns = []
  while len(ns) < rantime:
    n = random.randint(ran1, ran2)
    if not n in ns:
      ns.append(n)
  return sorted(ns)

def rand_query(ran1, ran2, rantime):
  r_query = []
  while len(r_query) < rantime:
    n_q = rand_ints_nodup(ran1, ran2, 2)
    if not n_q in r_query:
      r_query.append(n_q)
  return sorted(r_query)

from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
import heapq
import math
from fractions import gcd
import random
import string
import copy
from itertools import combinations, permutations, product
from operator import mul
from functools import reduce
from bisect import bisect_left, bisect_right

import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7






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

Solution (Python):
import math



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

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

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

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

if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
import sys

s = (input())

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

Solution (Python):
upper_case = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
lower_case = 'abcdefghijklmnopqrstuvwxyz'

c = input()
if c in upper_case:
  print('A')
else:
  print('a')

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

    upper = list('ABCDEFGHIJKLMNOPQRSTUVWXYZ')

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

if __name__ == '__main__':
    main()

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

Solution (Python):
alpha = input().rstrip()

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

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

Solution (Python):
import sys

stdin = sys.stdin

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

a = ns()

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

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

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

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

Solution (Python):

from sys import stdin
input = stdin.readline
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
ins = lambda : input().strip()
DBG = True 
BIG = 10**18
R = 10**9 + 7

def ddprint(x):
  if DBG:
    print(x)

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']
s = ins()
if s[0] in alpha:
    print('a')
else:
    print('A')

Solution (Python):

a = input()


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

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

Solution (Python):
import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
INF = 1000000000000

a = S()

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

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

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

Solution (Python):
i = input()

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

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

Solution (Python):
a = input()

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

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

a = input().strip()

import string

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

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

Solution (Python):
s=input()

if 65<=ord(s)<=90:
  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')
else:
  print('a')

Solution (Python):



import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    a = i2s()
    print('A' if a.isupper() else 'a')
    return

main()

Solution (Python):
def main():

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


if(__name__ == '__main__'):
  main()

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

if __name__ == '__main__':
    main()

Solution (Python):
s = input()
L = 'abcdefghijklmnopqrstuvwxyz'

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

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

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

Solution (Python):
def readinput():
    s=input()
    return s

def main(s):
    if 'A' <= s and s <='Z':
        return 'A'
    elif 'a' <= s and s <= 'z':
        return 'a' 
    return ''

if __name__=='__main__':
    s=readinput()
    ans=main(s)
    print(ans)

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

Solution (Python):
n=input()

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

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

Solution (Python):
from string import ascii_uppercase

a = input()

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

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

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

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

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

Solution (Python):
alpha=input()

cap=str.upper(alpha)

if cap==alpha:
    print("A")
else:
    print("a")

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

pat = re.compile(r'[A-Z]')
m = re.match(pat, s)

if (m != None):
    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):
n = input()

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

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

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

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

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

Solution (Python):
a = input()

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

Solution (Python):




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

    pass

if __name__ == '__main__':
    main()

Solution (Python):
S = input()
if ord(S) <= 90:
  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):
x = input()

judge = x.isupper()

if judge == True:
  print('A')
else:
  print('a')

Solution (Python):
word = input()

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

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

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

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

Solution (Python):
C = input()

if C.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):
X =  input()

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

Solution (Python):
import sys

def input():
    return sys.stdin.readline()[:-1]


X = input()
A = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"

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

Solution (Python):
import string
x = string.ascii_lowercase

if input() in x:
    print('a')
else:
    print('A')

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

Solution (Python):
s = input()
print(["A", "a"][s.islower()])

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

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

Solution (Python):
import re
p = re.compile(r"[a-z]+")
a = input()
if p.fullmatch(a):
  print("a")
else:
  print("A")

Solution (Python):
a = input()

b = str.upper(a)

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

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

Solution (Python):

a = input()
print(["A", "a"][a.islower()])

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

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

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

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

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

if __name__ == "__main__":
    main()