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-----
B

-----Sample Output-----
A

B is uppercase, so we should print A.

Difficulty: introductory

Starter code:

Solutions:
S = input()
ans = 'A'
if S.islower():
  ans = 'a'

print(ans)

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

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

p = str(input())

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

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

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

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

x = input()

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

alpha = str(input())
if ord('a') <= ord(alpha) <= ord('z'):
    print('a')
elif ord('A') <= ord(alpha) <= ord('Z'):
    print('A')

import sys
from collections import deque, defaultdict, Counter
from itertools import accumulate, product, permutations, combinations
from operator import itemgetter
from bisect import bisect_left, bisect_right
from heapq import heappop, heappush
from math import ceil, floor, sqrt, gcd, inf
from copy import deepcopy
import numpy as np
import scipy as sp

INF = inf
MOD = 1000000007

s = input()

tmp = 0
res = 0

if 97 <= ord(s) <= 122:
    res = "a"
else:
    res = "A"

print(res)


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

print(('a' if 'Z' < input() else 'A'))


alp=input()

if alp==alp.upper():
  print("A")
elif alp==alp.lower():
  print("a")

import re

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

if a is None:
    print('A')
else:
    print('a')

print("Aa"[ord(input())>96])

poe='abcdefghijklmnopqrstuvwxyz'

s=input()

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

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

a = input()

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

else:
    print("a")


alpha = input()

text = 'abcdefghijklmnopqrstuvwxyz'

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

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


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


a = input()

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


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


a= input()

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

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

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

n = input()
 
s = "abcdefghijklmnopqrstuvwxyz"
 
if n in s:
  print("a")
else:
  print("A")

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


A = input()

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

m = input()
x = ord(m)
if x >= 97 and x <= 122:
    print("a")
else:
    print("A")

x=input()


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

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

print('aA'[input()<'a'])

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

#!/usr/bin/env python3
import sys
sys.setrecursionlimit(1000000)
from collections import deque

N = (input())

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


a = input()

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


a = input()

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


a = input()
if a in list('abcdefghijklmnopqrstuvwxyz'):
    print('a')
    return
else:
    print('A')
    return

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

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

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

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

#                               #
    # author : samars_diary #
    # 18-09-2020 │ 15:00:33 #
#                               #

import sys, os.path

#if(os.path.exists('input.txt')):
    #sys.stdin = open('input.txt',"r")
    #sys.stdout = open('output.txt',"w")

sys.setrecursionlimit(10 ** 5)

def mod(): return 10**9+7
def i(): return sys.stdin.readline().strip()
def ii(): return int(sys.stdin.readline())
def li(): return list(sys.stdin.readline().strip())
def mii(): return map(int, sys.stdin.readline().split())
def lii(): return list(map(int, sys.stdin.readline().strip().split()))

#print=sys.stdout.write

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

for _ in range(1):
    solve()

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

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


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

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

x = input()

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

s = input()
if(s[0].islower()):
    print('a')
else:
    print('A')    


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

a = input()

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

b=input()
le=("abcdefghijklmnopqrstuvwxyz")
if b in le:
    print("a")
else:
    print("A")

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

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


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

n = input()

s = "abcdefghijklmnopqrstuvwxyz"

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


# uppercase = A, lowercase = a

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


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


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

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

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

alpha = input()
print('A' if alpha >= 'A' and alpha <= 'Z' else 'a')

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

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


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

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

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

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

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

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

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

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

import sys

alpha = input()

text = 'abcdefghijklmnopqrstuvwxyz'

for k in range(26):
    if text[k] == alpha:
        print('a')
        return
    else:
        if k == 25:
            print('A') 

a = input()

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


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

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, copy,bisect
#from operator import itemgetter
#from heapq import heappush, heappop
#import numpy as np
#import sympy
#from scipy.sparse.csgraph import breadth_first_order, depth_first_order, shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson
#from scipy.sparse import csr_matrix
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
import sys

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

stdin = sys.stdin

ni = lambda: int(ns())
nf = lambda: float(ns())
na = lambda: list(map(int, stdin.readline().split()))
nb = lambda: list(map(float, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

a = ns()
print('A') if a.isupper() else print('a')


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

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

s = input()

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

import re

n = input()

flag = re.match(r"[a-z]",n)
print("a") if flag!= None else print('A')

Al = input()

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

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

a = input()

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

X = input()

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

from string import ascii_lowercase
a = input()

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

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

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


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

Q = input()
W = {'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'}

# 文字列Qが集合Wの中に含まれるなら…
if Q in W:
    print('a')
else:
    print('A')

print(["a","A"][65<=ord(input())<=90])

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

main()


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

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

a = input()

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

else:
    print("a")


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

a = input()

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


α = input()
if α.islower():
    print('a')

else:
    print('A')


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


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

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