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.



Sample input:
B


Sample output:
A

Submission status: Accepted

Solution code:

s = input()

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
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"]
n = input("")
if n in l:
    print("A")
else:
    print("a")

Submission status: Accepted

Solution code:
A=input()
#print(ord(A))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    # Failed to predict input format
    x = input()
    if x.isupper():
        print('A')
    else:
        print('a')
    pass

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def resolve():
    A = input()
    if A in "ABCDEFGHIJKLMNOPQRSTUVWXYZ":
        print("A")
    else:
        print("a")


resolve()

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
alpha = input().strip()

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

Submission status: Accepted

Solution code:
a=input()

b=a.upper()

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

Submission status: Accepted

Solution code:
# Template 1.0
import sys, re
from collections import deque, defaultdict, Counter, OrderedDict
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log, floor
from heapq import heappush, heappop, heapify, nlargest, nsmallest
def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def sortListWithIndex(listOfTuples, idx):   return (sorted(listOfTuples, key=lambda x: x[idx]))
def sortDictWithVal(passedDic):
    temp = sorted(passedDic.items(), key=lambda kv: (kv[1], kv[0]))
    toret = {}
    for tup in temp:
        toret[tup[0]] = tup[1]
    return toret
def sortDictWithKey(passedDic):
    return dict(OrderedDict(sorted(passedDic.items())))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

t = input()

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

Submission status: Accepted

Solution code:
s=str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin, stdout
import heapq
import cProfile
from collections import Counter, defaultdict, deque
from functools import reduce
import math


def get_int():
    return int(stdin.readline().strip())


def get_tuple():
    return map(int, stdin.readline().split())


def get_list():
    return list(map(int, stdin.readline().split()))


def solve():
    return

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


TestCases = False

if TestCases:
    for i in range(get_int()):
        main()
else:
    main()

Submission status: Accepted

Solution code:
"""
~~ Author : Bhaskar
~~ Dated : 10~06~2020
"""

import sys
from bisect import *
from math import floor,sqrt,ceil,factorial as F,gcd,pi
from itertools import chain,combinations,permutations,accumulate
from collections import Counter,defaultdict,OrderedDict,deque
from array import array
INT_MAX = sys.maxsize
INT_MIN = -(sys.maxsize)-1
mod = 1000000007
ch = "abcdefghijklmnopqrstuvwxyz"
lcm = lambda a,b : (a*b)//gcd(a,b)
setbit = lambda x : bin(x)[2:].count("1")
input = lambda : sys.stdin.readline()

def solve():
    s = sys.stdin.readline().replace("\n","")
    if s.isupper():
        print("A")
    else:
        print("a")


if __name__ == "__main__":
    try:
        sys.stdin = open('input.txt','r')
        sys.stdout = open('output.txt','w')
    except:
       pass
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=lambda:input()
I=lambda:int(input())
L=lambda:list(map(int,input().split()))
LS=lambda:list(map(str,input().split()))

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
const=list('QWERTYUIOPASDFGHJKLZXCVBNM')
a=input()
if a in const:
  print('A')
else:
  print('a')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

a = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
al = [chr(ord('a') + i) for i in range(26)]
AL = [chr(ord('A') + i) for i in range(26)]
s = input()
if s in al:
    print("a")
else:
    print("A")

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
def main():
    s = input()
    if s == s.upper():
        print("A")
    else:
        print("a")
main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    a = input().rstrip()
    if a.isupper():
        print("A")
    else:
        print("a")

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

a = input()

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

Submission status: Accepted

Solution code:
from collections import defaultdict,deque
from sys import stdin,setrecursionlimit
import heapq,bisect,math,itertools,string,queue,datetime,copy
setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, stdin.readline().split()))

s = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()

def main():
    a = input()

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




if __name__ == "__main__":
  main()

Submission status: Accepted

Solution code:
import sys
import itertools
# import numpy as np
import time
import math
 
sys.setrecursionlimit(10 ** 7)
 
from collections import defaultdict
 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

# map(int, input().split())
# list(map(int, input().split()))

n = input()

if ord(n) < 97:
    print('A')
else:
    print('a')

Submission status: Accepted

Solution code:
# itne me hi thakk gaye?
n = input()
if n.isupper():
    print('A')
else:
    print('a')

Submission status: Accepted

Solution code:
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']
if s in abc:
    print('a')
else:
    print('A')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import string
import sys


def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
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 S(): return input()
def LS(): return input().split()


a = S()
if a in string.ascii_lowercase:
    print('a')
else:
    print('A')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
# import numpy as np
sys.setrecursionlimit(int(pow(10,6)))
# sys.stdin = open("input.txt", "r")
# sys.stdout = open("output.txt", "w")
mod = int(pow(10, 9) + 7)
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end)
def l(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]

# @lru_cache(None)

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

S = input()

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

Submission status: Accepted

Solution code:
low = "qwertyuioplkjhgfdsazxcvbnm"
hig = "QWERTYUIOPLKJHGFDSAZXCVBNM"
a = input()
if a in low:
  print("a")
else:
  print("A")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import itertools as it
def I():return int(sys.stdin.readline().replace("\n",""))
def I2():return map(int,sys.stdin.readline().replace("\n","").split())
def S():return str(sys.stdin.readline().replace("\n",""))
def L():return list(sys.stdin.readline().replace("\n",""))
def Intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def Lx(k):return list(map(lambda x:int(x)*-k,sys.stdin.readline().replace("\n","").split()))

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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

Submission status: Accepted

Solution code:
c = input()

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

'''

'''

a = input().strip()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    a = input()
    if ord("a") <= ord(a) <= ord("z"):
        print("a")
    else:
        print("A")

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#dt = {} for i in x: dt[i] = dt.get(i,0)+1
import sys
input = sys.stdin.readline
ipnl = lambda n: [int(input()) for _ in range(n)]
inp = lambda :int(input())
ip = lambda :[int(w) for w in input().split()]

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

Submission status: Accepted

Solution code:
import math  # noqa: F401
from typing import Dict, List, Optional, Tuple, Union  # noqa: F401


def main(a: str):
    print(["A", "a"][a.islower()])


if __name__ == "__main__":
    a = input()
    main(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
x = input()
if x.isupper():
  print('A')
else:
  print('a')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
K = ord(a)
if K < 97:
  print("A")
else:
  print("a")

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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


q1()

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.read
readline = sys.stdin.buffer.readline
INF = float('inf')


def main():
    s = readline().decode('utf-8')
    if s.isupper():
        print('A')
    else:
        print('a')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = input()
if "a" <= a <= "z":
  print("a")
else:
  print("A")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
if ord("a") <= ord(a) <= ord("z"):
    print("a")
else:
    print("A")

Submission status: Accepted

Solution code:
def resolve():
    s = input()
    if s.islower():
        print("a")
    else:
        print("A")
resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
import re


a = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

Solution code:
from string import ascii_lowercase

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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 LF(): return [float(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()

# a〜z -- START --
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']
# a〜z --- END ---

# A~Z -- START --
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']
# A~Z --- END ---

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

# main()
print(main())

Submission status: Accepted

Solution code:
import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict

# import fractions

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)
# lcm = lambda x, y: (x * y) // fractions.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()

Submission status: Accepted

Solution code:
# coding: utf-8
import sys
# from operator import itemgetter
sysread = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10 ** 7)
#from heapq import heappop, heappush
#from collections import OrderedDict, defaultdict
#import math
#from itertools import product, accumulate, combinations, product
#import bisect# lower_bound etc
#import numpy as np
# from copy import deepcopy
#from collections import deque
#import numba

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

if __name__ == "__main__":
    run()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:

a=input()

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

Solution code:
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 fractions import gcd
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")

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# import sys
# readline = sys.stdin.readline
# generator = (readline().strip() for _ in range(N))

# N, M = map(int, input().split())
# As = list(map(int, input().split()))
# queries = (input() for _ in range(N))


def solve():
    alpha = input()

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

    return 'a'


def main():
    print(solve())


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left #bisect_left(list, value)
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')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
# from collections import defaultdict, deque
import math

# import copy
# from bisect import bisect_left, bisect_right
# import heapq

# sys.setrecursionlimit(1000000)

# input aliases
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__":
    # main()
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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


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


    print(solve(S))

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.readline


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
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()

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
alpha = input()

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

Submission status: Accepted

Solution code:
#!usr/bin/env pypy3
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
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()
#N = int(input())
#N, M = map(int, input().split())
#A = list(map(int, input().split()))
#A = [int(input()) for _ in range(N)]
#ABC = [list(map(int, input().split())) for _ in range(N)]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
input = stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = input()

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