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

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

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

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

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

Solution (Python):
s=input()

s=ord(s)

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

Solution (Python):
ab=input()
if ab in 'abcdefghijklmnopqrstuvwxyz':
    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):
S = input()

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

Solution (Python):
s = input()

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

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):
a = input()

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

Solution (Python):
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left
from functools import reduce
from decimal import Decimal, getcontext

def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_list(N): return [s_list() for _ in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    s = s_input()

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

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

if __name__ == '__main__':
    main()

Solution (Python):

a = input()

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

Solution (Python):
alphabet='abcdefghijklmnopqrstuvwxyz'
a=input()
print('a' if alphabet.count(a)==1 else '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):
a = input()
if a.isupper():
    print("A")
else:
    print("a")

Solution (Python):
inp = input()

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

Solution (Python):
import sys
import os
import itertools
import numpy as np
from collections import deque

def main():
    if os.getenv("ENV")=='LOCAL':
        sys.stdin = open(os.path.dirname(__file__)+'/input.txt', 'r')

    S=input()

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

if __name__ == '__main__':
    main()

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

Solution (Python):
a = input()
l = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
for s in l:
  if a==s:
    print("A")
    exit()
    
print("a")

Solution (Python):


import math
import re
import numpy as np
import copy


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

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

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

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

Solution (Python):
s = input()
t = s.lower()

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

Solution (Python):
ori = input()

lower_ori = ori.lower()

if ori == lower_ori:
    print("a")
else:
    print("A")

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

Solution (Python):

L = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
s = input()
print("A" if s in L else "a")

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

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

Solution (Python):


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

Solution (Python):


import sys; import math; from collections import *


def get_ints(): return map(int, input().split())
def get_list(): return list(get_ints())
def printspx(*args): return print(*args, end="")
def printsp(*args): return print(*args, end=" ")

UGLYMOD = int(1e9+7); SEXYMOD = 998244353; MAXN = int(1e5)




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


'''
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
THE LOGIC AND APPROACH IS MINE @luctivud ( UDIT GUPTA )
Link may be copy-pasted here if it's taken from other source.
DO NOT PLAGIARISE.
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
'''

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

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7

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

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

Solution (Python):
a=(input())
b=a.capitalize()
ans='a'
if a==b:
    ans='A'
print(ans)

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

Solution (Python):

import sys

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


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


if __name__ == '__main__':
    main()

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

Solution (Python):
a = input()

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

Solution (Python):
n=input()

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

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

Solution (Python):
a=input()

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

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

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

Solution (Python):
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate, product, combinations_with_replacement
import sys
import bisect
import string
import math
import time


def I(): return int(input())
def S(): return input()
def MI(): return map(int, input().split())
def MS(): return map(str, input().split())
def LI(): return [int(i) for i in input().split()]
def LI_(): return [int(i)-1 for i in input().split()]
def StoI(): return [ord(i)-97 for i in input()]
def ItoS(nn): return chr(nn+97)
def input(): return sys.stdin.readline().rstrip()
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 print_matrix(mat):
    for i in range(len(mat)):
        print(*['IINF' if v == IINF else "{:0=4}".format(v) for v in mat[i]])


yn = {False: 'No', True: 'Yes'}
YN = {False: 'NO', True: 'YES'}
MOD = 10**9+7
inf = float('inf')
IINF = 10**19
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']
show_flg = False



def main():
    s = S()

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


if __name__ == '__main__':
    main()

Solution (Python):

A = str(input())
ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'

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

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

Solution (Python):
import re

a = input()

reg_big = re.compile('[A-Z]')

if reg_big.match(a):
  print('A')
else:
  print('a')

Solution (Python):
from sys import exit
import math
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

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

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

Solution (Python):
ALPHA = input()

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

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

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

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

    if a.isupper():
        print("A")
    else:
        print("a")
if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
a = input()

if 'A' <= a <= 'Z':
    print('A')
elif 'a' <= a <= 'z':
    print('a')

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

Solution (Python):

n = input()

cord = ord(n)

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

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

Solution (Python):
S = input()

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

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

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

Solution (Python):



import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

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

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

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

Solution (Python):
a = input()

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

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

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

Solution (Python):

import sys
input = sys.stdin.readline



def swaparr(arr, a,b):
    temp = arr[a];
    arr[a] = arr[b];
    arr[b] = temp


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


def nCr(n, k): 
    if(k > n - k): 
        k = n - k 
    res = 1
    for i in range(k): 
        res = res * (n - i) 
        res = res / (i + 1) 
    return int(res) 


def upper_bound(a, x, lo=0):
    hi = len(a)
    while lo < hi:
        mid = (lo+hi)//2
        if a[mid] < x:
            lo = mid+1
        else:
            hi = mid
    return lo


def primefs(n):
    
    primes = {}
    while(n%2 == 0 and n > 0):
        primes[2] = primes.get(2, 0) + 1
        n = n//2
    for i in range(3, int(n**0.5)+2, 2):
        while(n%i == 0 and n > 0):
            primes[i] = primes.get(i, 0) + 1
            n = n//i
    if n > 2:
        primes[n] = primes.get(n, 0) + 1
    
    
    return primes


def power(x, y, p): 
    res = 1
    x = x % p  
    if (x == 0) : 
        return 0
    while (y > 0) : 
        if ((y & 1) == 1) : 
            res = (res * x) % p 
        y = y >> 1      
        x = (x * x) % p 
    return res 


def swap(a,b):
    temp = a
    a = b
    b = temp
    return a,b









def find(x, link):
    p = x;
    while( p != link[p]):
        p = link[p];
    
    while( x != p):
        nex = link[x];
        link[x] = p;
        x = nex;
    return p;




def union(x, y, link, size):
    x = find(x, link)
    y = find(y, link)
    if size[x] < size[y]:
        x,y = swap(x,y)
    if x != y:
        size[x] += size[y]
        link[y] = x


def sieve(n): 
    prime = [True for i in range(n+1)] 
    p = 2
    while (p * p <= n): 
        if (prime[p] == True): 
            for i in range(p * p, n+1, p):
                prime[i] = False
        p += 1
    return prime


MAXN = int(1e6 + 5)
def spf_sieve():
    spf[1] = 1;
    for i in range(2, MAXN):
        spf[i] = i;
    for i in range(4, MAXN, 2):
        spf[i] = 2;
    for i in range(3, ceil(MAXN ** 0.5), 2):
        if spf[i] == i:
            for j in range(i*i, MAXN, i):
                if spf[j] == j:
                    spf[j] = i;
    




def factoriazation(x):
    ret = {};
    while x != 1:
        ret[spf[x]] = ret.get(spf[x], 0) + 1;
        x = x//spf[x]
    return ret
    
    


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

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


MOD = int(1e9)+7;
CMOD = 998244353;
INF = float('inf'); NINF = -float('inf');



s = input().strip();
k = ord(s);
if k >= 97 and k <= 97+26:
    print('a');
else:
    print('A');

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


if __name__ == '__main__':
    t=1
    for _ in range(t):
        solve()

Solution (Python):
s = input()

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

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

Solution (Python):

def s0():return input()
def s1():return input().split()
def s2(n):return [input() for x in range(n)]
def s3(n):return [input().split() for _ in range(n)]
def s4(n):return [[x for x in s] for s in s2(n)]
def n0():return int(input())
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(input()) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]
def t3(n):return [tuple(int(x) for x in input().split()) for _ in range(n)]
def p0(b,yes="Yes",no="No"): print(yes if b else no)








s=s0()

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

Solution (Python):
if input().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):
import sys

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


def main():
    S = input().strip()

    if ord('A') <= ord(S[0]) <= ord('Z'):
        print("A")
    else:
        print("a")


if __name__ == '__main__':
    main()

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

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

A = input().rstrip()

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

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

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

a = ord(s)
for i in range(26):
    if ord("A") + i == a:
        print("A")
        sys.exit()

print("a")

Solution (Python):
s = input()

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

Solution (Python):
alpha = input()


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

Solution (Python):
s = input()
abc = ['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']
ABC =['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 s in abc:
  print('a')
elif s in ABC:
  print('A')

Solution (Python):
a=input()

if a >= 'A' and a <= 'Z':
    ans = "A"
else:
    ans = "a"

print(ans)

Solution (Python):



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

Solution (Python):
a = input()

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

Solution (Python):
a = input()

num = ord(a)

if 65 <= num <= 96:
    print('A')
else:
    print('a')

Solution (Python):
a=input()

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

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

Solution (Python):
s = input()

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

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

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

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

Solution (Python):
a = input()

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

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

Solution (Python):
a = input()

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

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

Solution (Python):


import sys
read = sys.stdin.read
readline = sys.stdin.readline



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

Solution (Python):
alpha = input()

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

Solution (Python):
s = input()

s2=s.upper()

if s==s2:
	print('A')
else:
	print('a')

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

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

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

Solution (Python):
a=input()

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

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

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

Solution (Python):
a=input()

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

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

Solution (Python):




import sys
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

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

    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

Solution (Python):
a = input()

ans = "A"

if a.islower():
    ans = "a"
print(ans)

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

import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

S = sr()
if ord(S) <= ord('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.islower():
  print('a')
else:
  print('A')

Solution (Python):
A=input()

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

Solution (Python):


a = input()
u_a = a.upper()

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

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

Solution (Python):
import numpy as np

a=input()

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**7) 
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right

from collections import deque


from collections import Counter

from itertools import accumulate,combinations,permutations

from heapq import heapify,heappop,heappush


from functools import lru_cache

from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def main():
    mod = 1000000007
    

    
    
    
    
    


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


if __name__ == "__main__":
    main()

Solution (Python):
a = input()

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

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

a = input().rstrip()

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

Solution (Python):



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

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

Solution (Python):
a = input()

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

Solution (Python):
a = input()

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

Solution (Python):
a=input()

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

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

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

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

main()

Solution (Python):
a = input()

A = a.upper()

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

Solution (Python):




import numpy as np

def int_mtx(N):
    x = []
    for _ in range(N):
        x.append(list(map(int,input().split())))
    return np.array(x)

S = input()

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

Solution (Python):
S = input()

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

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

Solution (Python):
N = input()

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

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

Solution (Python):
import sys
from io import StringIO
import unittest
import os


sys.setrecursionlimit(999999999)



def resolve(test_def_name=""):
    
    
    
    
    
    

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



class TestClass(unittest.TestCase):
    def assertIO(self, assert_input, output):
        stdout, sat_in = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(assert_input)
        resolve(sys._getframe().f_back.f_code.co_name)
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, sat_in
        self.assertEqual(out, output)

    def test_input_1(self):
        test_input = """B"""
        output = """A"""
        self.assertIO(test_input, output)

    def test_input_2(self):
        test_input = """a"""
        output = """a"""
        self.assertIO(test_input, output)

    
    def tes_t_1original_1(self):
        test_input = """データ"""
        output = """データ"""
        self.assertIO(test_input, output)



if __name__ == "__main__":
    if os.environ.get("USERNAME") is None:
        
        resolve()

    else:
        
        unittest.main()

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

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

if __name__ == '__main__':
    main()

Solution (Python):
alpha = input()

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

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

Solution (Python):
a=input()

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

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

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

def int1(x): return int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MS(): return input().split()
def LS(): return list(input())
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def printlist(lst, k=' '): print(k.join(list(map(str, lst))))
INF = float('inf')







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

if __name__ == '__main__':
    solve()

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

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

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

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

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

Solution (Python):

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

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

Solution (Python):
a = input()

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

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

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

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

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

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
import bisect
import numpy as np
import math
from collections import deque
from collections import defaultdict
from math import gcd




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

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

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





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

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

Solution (Python):
a = input()

if a in "ABCDEFGHIJKLMNOPQRSTUVWZXY":
    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):
a=input()
komoji="abcdefghijklmnopqrstuvwxyz"
oomoji="ABCDEFGHIJKLMNOPQRSTUVWXYZ"
if a in komoji:
    print("a")
else:
    print("A")

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

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

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

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

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

if __name__ == "__main__":
    solve()

Solution (Python):
a = input()

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

Solution (Python):
def resolve():
    '''
    code here
    '''
    A = input()

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

if __name__ == "__main__":
    resolve()