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:
from sys import stdin
data = stdin.readline().rstrip()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()
x = ord(x)
if x>=65 and x<=90:
    print('A')
if x>=97 and x<=122:
    print('a')

Submission status: Accepted

Solution code:
import sys


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


sys.setrecursionlimit(20000000)

MOD = 10 ** 9 + 7
INF = float("inf")


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

Submission status: Accepted

Solution code:
a=input()

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict
it = lambda: list(map(int, input().strip().split()))
INF = float('inf')


if __name__ == '__main__':
    ch = input().strip()
    if ch == ch.upper():
        print('A')
    else:
        print('a')

Submission status: Accepted

Solution code:
import re

alpha = input()

if(re.compile("[A-Z]").search(alpha)):
    print("A")
else:
    print("a")

Submission status: Accepted

Solution code:
alpha = input()
if alpha.isupper() == True:
  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:
import sys
input = lambda: sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin, stdout

int_in = lambda: int(stdin.readline())
arr_in = lambda: [int(x) for x in stdin.readline().split()]
mat_in = lambda rows: [arr_in() for _ in range(rows)]
str_in = lambda: stdin.readline().strip()
out = lambda o: stdout.write("{}\n".format(o))
arr_out = lambda o: out(" ".join(map(str, o)))
bool_out = lambda o: out("YES" if o else "NO")
tests = lambda: range(1, int_in() + 1)
case_out = lambda i, o: out("Case #{}: {}".format(i, o))


if __name__ == "__main__":
    a = str_in()
    out("A" if a == a.upper() else "a")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))


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

Submission status: Accepted

Solution code:
import re
S = input()

if re.match("[A-Z]", S):
    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.isupper():
    print('A')
else:
    print('a')

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = raw_input().strip()

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

Submission status: Accepted

Solution code:
moji=input()
alpa='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
if moji in alpa:
  print('A')
else:
  print('a')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
letter = input()

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def LI(): return list(map(int, input().split()))
def I(): return map(int, input().split())
mod = 10**9 + 7

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

Submission status: Accepted

Solution code:
a = input()
if str.isupper(a) == 1:
    print("A")
elif str.islower(a) == 1:
    print("a")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
    
def solve(N:str):
    print("A" if str.isupper(N) else "a")
    return 

# 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():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = next(tokens)
    solve(N)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
X = input()
if X.isupper() == True:
    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:
print(chr(65+(input()>'Z')*32))

Submission status: Accepted

Solution code:
print(chr(65+ord(input())//97*32))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

Solution code:
x = input()
if x.isupper():
    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:
a=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:
s=input()
if ord(s[0])>=97:
  print('a')
else:
  print('A')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/local/bin/python3
# coding: utf-8
a = input()
if(a.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:
c = input()
if(c in "ABCDEFGHIJKLMNOPQRSTUVWXYZ"):
  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 0 <= ord("Z") - ord(a) <= 25:
    print("A")
else:
    print("a")

Submission status: Accepted

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

Submission status: Accepted

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


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = input()

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

Submission status: Accepted

Solution code:
print('aA'[input()<'a'])

Submission status: Accepted

Solution code:
c = input()

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

Submission status: Accepted

Solution code:
input = str(input())
check = input.isupper()

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

Submission status: Accepted

Solution code:
import string

a = input()

if a in string.ascii_uppercase:
    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:
c = input()

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

Submission status: Accepted

Solution code:
a = input()

if 0 <= 'abcdefghijklmnopqrstuvwxyz'.find(a):
  print('a')
else:
  print('A')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
alpha = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
tmp = input()

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

Submission status: Accepted

Solution code:
big = ['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']
word = input()


if word in big:
  print('A')
else:
  print('a')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#n=int(input())
#a,b=map(int,input().split())
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
a=input()
l=list("abcdefghijklmnopqrstuvwxyz")
if a in l:
    print("a")
else:
    print("A")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import os
import sys
from atexit import register
from io import BytesIO
sys.stdin = BytesIO(os.read(0, os.fstat(0).st_size))
sys.stdout = BytesIO()
register(lambda: os.write(1, sys.stdout.getvalue()))
input = lambda: sys.stdin.readline().rstrip('\r\n')
raw_input = lambda: sys.stdin.readline().rstrip('\r\n')

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = input()
if c>='A' and c<='Z':
    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:
X = input()
up = X.upper()

if X == up:
    print("A")
else:
    print("a")

Submission status: Accepted

Solution code:
a = ord(input())
if a in range(ord("a"), ord("z")+1): print("a")
else: print("A")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#------------------------template--------------------------#
import os
import sys
from math import *
from collections import *
from fractions import *
from bisect import *
from heapq import*
from io import BytesIO, IOBase
def vsInput():
    sys.stdin = open('input.txt', 'r')
    sys.stdout = open('output.txt', 'w')
BUFSIZE = 8192
class FastIO(IOBase):
    newlines = 0
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
def value():return tuple(map(int,input().split()))
def array():return [int(i) for i in input().split()]
def Int():return int(input())
def Str():return input()
def arrayS():return [i for i in input().split()]

#-------------------------code---------------------------#
#vsInput()


s=input()

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

Submission status: Accepted

Solution code:
s  = input()

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

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right 
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

s = input()
if ord('A') <= ord(s) <= ord('Z'):
    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:
ji = input()

if 'A' <= ji and ji <= 'Z':
  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:
n = input()
if n == n.upper():
    print('A')
else:
    print('a')

Submission status: Accepted

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

Submission status: Accepted

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = input()

if c.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:
from collections import defaultdict as dd
from collections import deque
import bisect
import heapq

def ri():
    return int(input())

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


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






mode = 's'

if mode == 'T':
    t = ri()
    for i in range(t):
        solve()
else:
    solve()

Submission status: Accepted

Solution code:
x=input()

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

Submission status: Accepted

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

def II(): return int(input())
def MII(): return map(int, input().split())
def LII(): return list(map(int, input().split()))

def main():
    alpha = input()

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
if ord('A') <= ord(a) < ord('a'):
  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:
a=input()

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

Submission status: Accepted

Solution code:
alpha = str(input())
if alpha.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:
string = input()

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

print(ans)

Submission status: Accepted

Solution code:
X = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
from decimal import *

input = sys.stdin.readline

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

def main():
	S = inputStr()

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


#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
alpha = input()


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    s: str = input()

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7


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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

s = input()

if s.isupper():
    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:
en2asc = lambda s: ord(s) - 97
print('A' if en2asc(input()) < 0 else 'a')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
alpha = input()
if alpha.isupper():
    print("A")
elif alpha.islower:
    print("a")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
b = input()

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

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

Solution code:
a = input()

if a.isupper():
	print("A")
elif a.islower():
	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:
#!python3

# input
x = input()


def main():
    if x.islower():
        ans = "a"
    else:
        ans = "A"
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys


def log(s):
    # print("| " + str(s), file=sys.stderr)
    pass


def output(x):
    print(x, flush=True)


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


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


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
 
# from math import factorial as fac
from collections import defaultdict
# from copy import deepcopy
import sys, math
f = None
try:
	f = open('q1.input', 'r')
except IOError:
	f = sys.stdin
if 'xrange' in dir(__builtins__):
	range = xrange
# print(f.readline())
sys.setrecursionlimit(10**2)

	
def print_case_iterable(case_num, iterable):
	print("Case #{}: {}".format(case_num," ".join(map(str,iterable))))

def print_case_number(case_num, iterable):
	print("Case #{}: {}".format(case_num,iterable))

def print_iterable(A):
	print (' '.join(A))

def read_int():
	return int(f.readline().strip())
def read_int_array():
	return [int(x) for x in f.readline().strip().split(" ")]
def rns():
	a =  [x for x in f.readline().split(" ")]
	return int(a[0]), a[1].strip()
def read_string():
	return list(f.readline().strip())
def ri():
	return int(f.readline().strip())
def ria():
	return [int(x) for x in f.readline().strip().split(" ")]
def rns():
	a =  [x for x in f.readline().split(" ")]
	return int(a[0]), a[1].strip()
def rs():
	return list(f.readline().strip())
def bi(x):
	return bin(x)[2:]





from collections import deque
import math
# NUMBER = 10**9 + 7
NUMBER = 998244353
def factorial(n) : 
	M = NUMBER
	f = 1
  
	for i in range(1, n + 1):  
		f = (f * i) % M # Now f never can  
						# exceed 10^9+7  
	return f
def mult(a,b):
	return (a * b) % NUMBER

def minus(a , b):
	return (a - b) % NUMBER

def plus(a , b):
	return (a + b) % NUMBER

def egcd(a, b):
	if a == 0:
		return (b, 0, 1)
	else:
		g, y, x = egcd(b % a, a)
		return (g, x - (b // a) * y, y)

def modinv(a):
	m = NUMBER
	g, x, y = egcd(a, m)
	if g != 1:
		raise Exception('modular inverse does not exist')
	else:
		return x % m
def choose(n,k):
	if n < k:
		assert false
	return  mult(factorial(n), modinv(mult(factorial(k),factorial(n-k))))
from collections import deque, defaultdict 
import heapq


from types import GeneratorType
def bootstrap(f, stack=[]):
	def wrappedfunc(*args, **kwargs):
		if stack:
			return f(*args, **kwargs)
		else:
			to = f(*args, **kwargs)
			while True:
				if type(to) is GeneratorType:
					stack.append(to)
					to = next(to)
				else:
					stack.pop()
					if not stack:
						break
					to = stack[-1].send(to)
			return to

	return wrappedfunc


def dfs(g, timeIn, timeOut,depths,parents): 
	# assign In-time to node u 
	cnt = 0
	# node, neig_i, parent, depth
	stack = [[1,0,0,0]]
	while stack:
		v,neig_i,parent,depth = stack[-1]
		parents[v] = parent
		depths[v] = depth
		# print (v)
		if neig_i == 0:
			timeIn[v] = cnt    
			cnt+=1
		while neig_i < len(g[v]):
			u = g[v][neig_i]
			if u == parent:
				neig_i+=1
				continue
			stack[-1][1] = neig_i + 1
			stack.append([u,0,v,depth+1])
			break
		if neig_i == len(g[v]):
			stack.pop()
			timeOut[v] = cnt
			cnt += 1
  
def isAncestor(u: int, v: int, timeIn: list, timeOut: list) -> str: 
	return timeIn[u] <= timeIn[v] and timeOut[v] <= timeOut[u] 

cnt = 0
@bootstrap
def dfs(v,adj,timeIn, timeOut,depths,parents,parent=0,depth=0):
	global cnt
	parents[v] = parent
	depths[v] = depth
	timeIn[v] = cnt
	cnt+=1
	for u in adj[v]:
		if u == parent:
			continue
		yield dfs(u,adj,timeIn,timeOut,depths,parents,v,depth+1)
	timeOut[v] = cnt
	cnt+=1
	yield 


def solution(s):
	return 'a' if ord(s[0])>=ord('a') else 'A'



	
def main():
	T = 1
	# T = ri()
	for i in range(T):
		s = rs()
		# k = ri()
		# a,b,n = ria()
		# b=ria()

		x = solution(s)
		if 'xrange' not in dir(__builtins__):
			print(x)
		else:
			print >>output,str(x)# "Case #"+str(i+1)+':',
	if 'xrange' in dir(__builtins__):
		print(output.getvalue())
		output.close()

if 'xrange' in dir(__builtins__):
	import cStringIO
	output = cStringIO.StringIO()
#example usage:
#    for l in res:
#       print >>output, str(len(l)) + ' ' +  ' '.join(l)

if __name__ == '__main__':
	main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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