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:
def main():
    a = input()
    if a.islower():
        print('a')
    else:
        print('A')
    
        
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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


#############
# Main Code #
#############

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

Submission status: Accepted

Solution code:
a = input()

#大文字
if(a.isupper()==True):
  print("A")
else:
  print("a")

Submission status: Accepted

Solution code:
import math
#map(int,input().split())
#int(x) for x in input().split()
#for _ in range(int(input())):
x=input()
y=x.upper()
if x==y:
	print('A')
else:
	print('a')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

s = (input())

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

Submission status: Accepted

Solution code:
upper_case = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
lower_case = 'abcdefghijklmnopqrstuvwxyz'

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

Submission status: Accepted

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

    upper = list('ABCDEFGHIJKLMNOPQRSTUVWXYZ')

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

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

a = ns()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#from collections import deque,defaultdict
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 # and False
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')

Submission status: Accepted

Solution code:
# H, W = map(int,input().split())
a = input()
# al = list(map(int,input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

Solution code:
alpha = input()

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

Submission status: Accepted

Solution code:
#!python3.8
# -*- coding: utf-8 -*-
# abc171/abc171_a
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()

Submission status: Accepted

Solution code:
def main():

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


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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from string import ascii_uppercase

a = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
alpha=input()

cap=str.upper(alpha)

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

Submission status: Accepted

Solution code:
import re
s = input()

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

if (m != None):
    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:
a = input()
if a <= 'Z':
  print('A')
else:
  print('a')

Submission status: Accepted

Solution code:
x = input()
if 65 <= ord(x) <= 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:
#!/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():
    c = input()
    if c.upper() == c:
        print("A")
    else:
        print("a")

    pass

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()

judge = x.isupper()

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

Submission status: Accepted

Solution code:
word = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = str(input())
if a ==a.upper():
    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:
n = input()
if n.isupper():
    print("A")
else:
    print("a")

Submission status: Accepted

Solution code:
X =  input()

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

Submission status: Accepted

Solution code:
import sys

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


X = input()
A = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"

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

Submission status: Accepted

Solution code:
import string
x = string.ascii_lowercase

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

b = str.upper(a)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a = input()
print(["A", "a"][a.islower()])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
#import numpy as np
import queue
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)

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

    return

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = input()

if ord(a) - ord('A') <= 26:
    print("A")
else:
    print("a")

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
## coding: UTF-8


s = input()

large = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
small = 'abcdefghijklmnopqrstuvwxyz'

ans = 'no'
for i in range(26):
    if(s == large[i]):
        ans = 'A'
    elif(s == small[i]):
        ans = 'a'

print(ans)

Submission status: Accepted

Solution code:
def main():
    c = input()
    if c>='a' and c<='z':
        print('a')
    else:
        print('A')

main()

Submission status: Accepted

Solution code:
import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:(input())
ips=lambda:input().split()

"""========main code==============="""
a=ip()
if( a.islower()):
    print("a")
else:
    print("A")

Submission status: Accepted

Solution code:
str = input() 

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

Submission status: Accepted

Solution code:
import sys 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
S = readline().decode()
if str.isupper(S):
    print('A')
else:
    print('a')

Submission status: Accepted

Solution code:
#a
M = str(input())
if M.islower()==True:
    print('a')
else:
    print('A')

Submission status: Accepted

Solution code:
a=input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()


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

Submission status: Accepted

Solution code:
import math
import fractions
import collections
import itertools
a=input()
if ord(a)-ord("a")>=0:
    print("a")
else:
    print("A")

Submission status: Accepted

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

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

if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
@author: H_Hoshigi
"""
def main():
    S = input()
    if S.isupper():
        print("A")
    else:
        print("a")

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
from math import floor, sqrt, factorial, hypot, log  # log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter, defaultdict, deque
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement
from bisect import bisect_left, bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint


def ceil(a, b): return (a + b - 1) // b


inf = float('inf')
mod = 10 ** 9 + 7


def pprint(*A):
    for a in A:     print(*a, sep='\n')


def INT_(n): return int(n) - 1


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


def MF(): return map(float, input().split())


def MI_(): return map(INT_, input().split())


def LI(): return list(MI())


def LI_(): return [int(x) - 1 for x in input().split()]


def LF(): return list(MF())


def LIN(n: int): return [I() for _ in range(n)]


def LLIN(n: int): return [LI() for _ in range(n)]


def LLIN_(n: int): return [LI_() for _ in range(n)]


def LLI(): return [list(map(int, l.split())) for l in input()]


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


def F(): return float(input())


def ST(): return input().replace('\n', '')

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = str(input())
n = int(ord(s[0]))
if n >= 97:
    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:
s = input()
al=[chr(ord('a') + i) for i in range(26)]
if s in al:
    print('a')
else:
    print('A')

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
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())
a = S()
ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
if a in ascii_lowercase:
    print('a')
else:
    print('A')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import numpy as np
import math
from collections import deque 
from functools import reduce

s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import string

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

Submission status: Accepted

Solution code:
a = input()

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
s = input()
print('A' if s in h else 'a')

Submission status: Accepted

Solution code:
a=input()

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

Submission status: Accepted

Solution code:
c = input()

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

Submission status: Accepted

Solution code:
from sys import stdin
a = (stdin.readline().rstrip())
if a == a.upper():
    print("A")
else:
    print("a")

Submission status: Accepted

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

alp = input()

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

Submission status: Accepted

Solution code:
def run(_char):
    '''
    '''
    print('A' if str.isupper(_char) else 'a')

if __name__ == '__main__':
    _char = input()
    run(_char)

Submission status: Accepted

Solution code:
a = input()
print(['a', 'A'][a.isupper()])

Submission status: Accepted

Solution code:
import string
a=string.ascii_uppercase
A=input()
flag=0
for i in a:
    if i==A:
        flag=1
        break
if flag==0:
    print("a")
else:
    print("A")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
#from collections import defaultdict, deque, Counter
#import bisect
#import heapq
#import math
#from itertools import accumulate
#from itertools import permutations as perm
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as combr
#from fractions import gcd
#import numpy as np

stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18

def main():
    a= str(stdin.readline().rstrip())
    #A, B, C = map(int, stdin.readline().rstrip().split())
    #l = list(map(int, stdin.readline().rstrip().split()))
    #numbers = [[int(c) for c in l.strip().split()] for l in sys.stdin]
    #word = [stdin.readline().rstrip() for _ in range(n)]
    #number = [[int(c) for c in stdin.readline().rstrip()] for _ in range(n)]
    #zeros = [[0] * w for i in range(h)]
    if a.islower():
        print("a")
    else:
        print("A")

main()

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=["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 n:
    print("a")
else:
    print("A")

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


s = readline().decode().rstrip()

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

Submission status: Accepted

Solution code:
def main():
    import string
    import sys
    def input():
        return sys.stdin.readline()[:-1]
    α=input()
    if α in string.ascii_uppercase:
        print("A")
    else:
        print("a")
    

    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input().isupper()

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

Submission status: Accepted

Solution code:
alpha = input()
tmp = "qwertyuiopasdfghjklzxcvbnm"
ans = 'A'
for i in tmp:
    if alpha == i:
        ans = 'a'
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
al = input()

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

Submission status: Accepted

Solution code:
a = input()
x = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
y = 'abcdefghijklmnopqrstuvwxyz'

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())

def main():
    if s.isupper():
        print("A")
        return
    print("a")
    return

main()

Submission status: Accepted

Solution code:
a = input()

print("A" if ord(a)<95 else "a" )

Submission status: Accepted

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def main() -> None:
    a = input()

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
i = input()

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

Submission status: Accepted

Solution code:

a = input()

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

print(ans)

Submission status: Accepted

Solution code:
A = ord(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s=input()
n=ord(s)
if 65<=n<=90:
    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:
# n = int(input())
s = input()

# a = [int(i) for i in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = input()

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

if X in al:
    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:
import re

S = input()

if re.fullmatch('[A-Z]',S):
  print('A')
else:
  print('a')

Submission status: Accepted

Solution code:
ord_s = ord(input())


if ord_s <=90:
    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:
# coding: utf-8
# Your code here!

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

Submission status: Accepted

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

from pprint import pprint
from collections import deque, defaultdict
import itertools
import math
import sys

sys.setrecursionlimit(10 ** 6)
INF = float('inf')


a = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#input
alpha = str(input())

#output
# %% 
if alpha.isupper():
    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:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys


def input():
    return sys.stdin.readline()


def resolve():
    s = input().rstrip()

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
if 64 < ord(input()) < 91:
    print("A")
else:
    print("a")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
INF = float('inf')

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

s=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
alpha = str( input() )

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