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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

import sys
import numpy as np
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

S = readline().decode().rstrip()

print("A") if S.isupper() 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:
N=input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


def read_int():
    return int(input().strip())


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


def solve():
    a = input().strip()
    if a.isupper():
        return 'A'
    return 'a'


if __name__ == '__main__':
    print(solve())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = input()

if X.isupper() == True:
    print('A')

else:
    print('a')

Submission status: Accepted

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

a = input().rstrip('\n')
if a.upper()==a:
  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:
a = input()
if a in 'ABCDEFGFIJKLMNOPQRSTUVWXYZ':
    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 sys, collections, bisect, itertools, heapq, math, copy, string
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    S = SS()

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

if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
Q = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!python3

import sys
iim = lambda: map(int, sys.stdin.readline().rstrip().split())

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

if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
# coding: utf-8
str = input()
if str.isupper():
    print("A")
else:
    print("a")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import collections
import itertools as it
import math
#import numpy as np
 
s  = input()
#  = int(input())
#  = map(int, input().split())
#  = list(map(int, input().split()))
#  = [int(input()) for i in range(N)]
#
## c = collections.Counter()

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

Submission status: Accepted

Solution code:
a = input()

if ord(a) > 95:
    print('a')
else:
    print('A')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from copy import deepcopy
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions
from operator import itemgetter
import itertools
import copy


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


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


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


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]


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:
a = input()

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

Submission status: Accepted

Solution code:
x = ord(input())
if x >= 97:
    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 = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
alpha=input()

A=ord("A")
Z=ord("Z")

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

Submission status: Accepted

Solution code:
"""
    こんにちは。これはクシャルです
    
    Author : thekushalghosh (クシャル)
    Team   : CodeDiggers
 
    I prefer Python language over the C++ language :p :D
        
    Visit my website : thekushalghosh.github.io
"""
import sys,math,cmath,time
start_time = time.time()
##########################################################################
################# ---- THE ACTUAL CODE STARTS BELOW ---- #################

def solve():
    c = insr()
    if "A" <= c <= "Z":
        print("A")
    else:
        print("a")
            
################## ---- THE ACTUAL CODE ENDS ABOVE ---- ##################
##########################################################################
 
def main():
    global tt
    if not ONLINE_JUDGE:
        sys.stdin = open("input.txt","r")
        sys.stdout = open("output.txt","w")
    t = 1
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        print("Time Elapsed :",time.time() - start_time,"seconds")
        sys.stdout.close()
    
#---------------------- USER DEFINED INPUT FUNCTIONS ----------------------#
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    return(input().strip())
def invr():
    return(map(int,input().split()))
 
#------------------ USER DEFINED PROGRAMMING FUNCTIONS ------------------#
def counter(a):
    q = [0] * (max(a) + 1)
    for i in range(len(a)):
        q[a[i]] = q[a[i]] + 1
    return(q)
 
def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1
    return(q)

#-----------------------------------------------------------------------#
        
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
    
    
main()

Submission status: Accepted

Solution code:
n = input()
if(n.isupper()):
  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:
s = input()
if 'A' <= s <= 'Z':
  print('A')
elif 'a' <= s <= 'z':
  print('a')

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys



if(__name__ == "__main__"):

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

Submission status: Accepted

Solution code:
c = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

s=ord(s)

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

Submission status: Accepted

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

if S.isupper():
    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:
def main():
    X = input()

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
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
# input = sys.stdin.readline 
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()

Submission status: Accepted

Solution code:

a = input()

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

Submission status: Accepted

Solution code:
alphabet='abcdefghijklmnopqrstuvwxyz'
a=input()
print('a' if alphabet.count(a)==1 else 'A')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp = input()

if inp.isupper() == True:
  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
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

import math
import re
import numpy as np
import copy


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
ori = input()

lower_ori = ori.lower()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
a="abcdefghijklmnopqrstuvwxyz"
if(input() in a):
    print("a")
else:
    print("A")

Submission status: Accepted

Solution code:
#                           जय श्री राम

import sys; import math; from collections import *
# sys.setrecursionlimit(10**6)

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)

#sys.stdin  = open("input.txt","r"); sys.stdout = open("output.txt","w")

# for _testcases_ in range(int(input())):
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 !!
'''

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
import sys

stdin = sys.stdin
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
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()

Submission status: Accepted

Solution code:
n=input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
if 0 <= ord(s) - ord("a") <= 25:
    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:
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
# show_flg = True


def main():
    s = S()

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A = str(input())
ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import re

a = input()

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ALPHA = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:

n = input()

cord = ord(n)

if ord('a') <= cord and cord <= ord('z'):
    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:
N = input()
if N.islower(): print("a")
else: print("A")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

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

Submission status: Accepted

Solution code:
a=input()
b=str.isupper(a)
if b:
  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:
n = input()
if ord('A') <= ord(n) and ord(n) <= ord('Z'): 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:
r=input()
print('A' if 'A'<=r<='Z' else 'a')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
## necessary imports
import sys
input = sys.stdin.readline
# from math import ceil, floor, factorial;

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

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

## nCr function efficient using Binomial Cofficient
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) 

## upper bound function code -- such that e in a[:i] e < x;
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

## prime factorization
def primefs(n):
    ## if n == 1    ## calculating primes
    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
    ## prime factoriazation of n is stored in dictionary
    ## primes and can be accesed. O(sqrt n)
    return primes

## MODULAR EXPONENTIATION FUNCTION
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 

## DISJOINT SET UNINON FUNCTIONS
def swap(a,b):
    temp = a
    a = b
    b = temp
    return a,b

# find function with path compression included (recursive)
# def find(x, link):
#     if link[x] == x:
#         return x
#     link[x] = find(link[x], link);
#     return link[x];

# find function with path compression (ITERATIVE)
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;


# the union function which makes union(x,y)
# of two nodes x and y
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

## returns an array of boolean if primes or not USING SIEVE OF ERATOSTHANES
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

#### PRIME FACTORIZATION IN O(log n) using Sieve ####
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;
    ## function for storing smallest prime factors (spf) in the array

################## un-comment below 2 lines when using factorization #################
# spf = [0 for i in range(MAXN)]
# spf_sieve() 
def factoriazation(x):
    ret = {};
    while x != 1:
        ret[spf[x]] = ret.get(spf[x], 0) + 1;
        x = x//spf[x]
    return ret
    ## this function is useful for multiple queries only, o/w use
    ## primefs function above. complexity O(log n)

## taking integer array input
def int_array():
    return list(map(int, input().strip().split()))
## taking string array input
def str_array():
    return input().strip().split();

#defining a couple constants
MOD = int(1e9)+7;
CMOD = 998244353;
INF = float('inf'); NINF = -float('inf');

################### ---------------- TEMPLATE ENDS HERE ---------------- ###################

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

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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)
# from sys import setrecursionlimit
# setrecursionlimit(1000000)
# from collections import Counter,deque,defaultdict
# import itertools
# import math
# import networkx as nx
# from bisect import bisect_left,bisect_right
# from heapq import heapify,heappush,heappop
s=s0()

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# abc171_a.py
S = input()
if S.islower():
    print("a")
else:
    print("A")

Submission status: Accepted

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

A = input().rstrip()

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

Submission status: Accepted

Solution code:
s = input()
import sys

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

print("a")

Submission status: Accepted

Solution code:
s = input()

if s in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ':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:
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')

Submission status: Accepted

Solution code:
a=input()

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

print(ans)

Submission status: Accepted

Solution code:
#n=int(input())
#h=list(map(int,input().split()))
#a,b,c=map(int,input().split())
s=input()
d=list("abcdefghijklmnopqrstuvwxyz")
if s in d:
  print("a")
else:
  print("A")