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: Wrong Answer

Solution code:
a = str(input())

Cap = ['A', 'B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z']

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

print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=input()
if(a.isupper()):
  print(a.lower())
else:
  print(a.upper())

Submission status: Wrong Answer

Solution code:
dic = ["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 = input()
if s in dic:
  print(s.upper())
else:
  print(s.lower())

Submission status: Wrong Answer

Solution code:
L = [chr(ord('a') + i) for i in range(26)]
U = [chr(ord('A') + i) for i in range(26)]
 
a = input()
if a in U:
    print('a')
if a in L:
    print('A')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    import sys
    sys.setrecursionlimit(10**9)
    input = sys.stdin.readline

    a = input()

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


main()

Submission status: Wrong Answer

Solution code:
#入力する文字A
A = input()

#判定N

N = A.isupper()

#print(N)

if N == True:
    print("A")
else:
    print("B")

Submission status: Wrong Answer

Solution code:
a = input()

if(a.isupper()):
  print(chr(ord(a)-1))
else:
  print(a)

Submission status: Wrong Answer

Solution code:
a = input()
if a == 'A':
    print('B')
elif a == 'a':
    print('b')
elif a == 'B':
    print('A')
else:
    print('a')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: 	A
# CreatedDate:  2020-06-21 20:42:18 +0900
# LastModified: 2020-06-21 21:04:18 +0900
#


import os
import sys
#import numpy as np
#import pandas as pd


def main():
    alpha = input()
    if 97 <= ord(alpha) and ord(alpha) <= 97+26:
        print(alpha.upper())
    else:
        print(alpha.lower())


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

if s.islower():
  print(s.upper())
else:
  print(s.lower())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=input()
if a == "A" or "B" or "C" or "D" or "E" or "F" or "G" or "H" or "I" or "J" or "K" or "L" or "M" or "N" or "O" or "P" or "Q" or "R" or "S" or "T" or "U" or "V" or "W" or "X" or "Y" or "Z":
  print("A")
else:
  print("a")

Submission status: Wrong Answer

Solution code:
a = (input())

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

Submission status: Wrong Answer

Solution code:
n=input()
a=n
a=a.upper()

if a==n:
  print("A")
else:
  print("b")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = input()

if n.islower():
  print(n.upper())
else:
  print(n.lower())

Submission status: Wrong Answer

Solution code:
L = [chr(ord('a') + i) for i in range(26)]
U = [chr(ord('A') + i) for i in range(26)]

a = input()
if a in U:
    print(a.lower())
if a in L:
    print(a.upper())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
t = input()
if(t.islower()):
  print(t.upper())
else:
  print(t.lower())

Submission status: Wrong Answer

Solution code:
alpha = str(input())

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

Submission status: Wrong Answer

Solution code:
alpha = input()

if 97 <= ord(alpha) < 122:
    print("a")
else:
    print("A")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
ch = input(str)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()
print (S)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
alpha = str(input())
if alpha.isupper():
  print(alpha.lower())
else:
  print(alpha.upper())

Submission status: Wrong Answer

Solution code:
c = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'

a=input()

for i in range(52):
    if c[i]== a:
        d = i + 26
        if d > 51:
            d = i-26
        print(c[d])
        exit(0)

Submission status: Wrong Answer

Solution code:
s=input()

if((ord('s')>=65 and ord('s')<=92)):
  print('A')
else:
  print('a')

Submission status: Wrong Answer

Solution code:
a = input()

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

Submission status: Wrong Answer

Solution code:
c = input()
if 'a' <= c <= 'z':
  print(c.upper())
else:
  print(c.lower())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=input()
a=n
a=a.upper()

if a==n:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
a = str(input())

if a.islower == True:
    print("a")
elif a.islower == False:
    print("A")

Submission status: Wrong Answer

Solution code:
def function (x):
  if x == x.upper():
    return "A"
  elif x == x.lower():
    return "a"

Submission status: Wrong Answer

Solution code:
S = input()

if S.isupper():
    print(S.lower())
else:print(S.upper())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = input()
al = list("abcdefghijklmnopqrstuvwxyz")
AL = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
if a in al:
    print(str.upper(a))
else:
    print(str.lower(a))

Submission status: Wrong Answer

Solution code:
alpha = input()
if alpha.isupper():
  alpha.lower()
else:
  alpha.upper()

print(alpha)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()
if S.upper():
    print(S.lower())
else:
    print(S.upper())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
import sys
import math
import itertools
import collections

a = input()
print(a.swapcase())

Submission status: Wrong Answer

Solution code:
x = input()

X = x.upper()

if x == X:
  print('A')
else:
  print('B')

Submission status: Wrong Answer

Solution code:
n = input()

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

Submission status: Wrong Answer

Solution code:
import string
ALPHABET = input()
if ALPHABET is string.ascii_lowercase:
    print("a")
else:
    print("A")

Submission status: Wrong Answer

Solution code:
s = input()

ans = 0

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
i = input()

if(i.isupper()):
  print("A")
if(i.islower()):
  print("B")

Submission status: Wrong Answer

Solution code:
N = input()

#A,B = map(int,input().split())

#A = [int(input()) for i in range(N)]

"""
    A = []
    for _ in range(N):
        A.append(list(map(int,input().split())))
"""

if N.isupper():
    print(N.lower())
else:
    print(N.upper())

Submission status: Wrong Answer

Solution code:
a = input()

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

Submission status: Wrong Answer

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

a = input()
if a.isupper():
    print(a.lower())
else:
    print(a.upper())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=input()

if a.isupper():
  print(a)
else:
  print(a.lower())

Submission status: Wrong Answer

Solution code:
s = input()
if s.isupper():
    print (s.lower())
else:
    print (s.upper())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=str(input())
ABC=[chr(i) for i in range(65, 65+26)]
if N in ABC:
    print("A")
else:
    print("B")

Submission status: Wrong Answer

Solution code:
a = input()
if a.islower():
    print(a.upper())
    exit()
else:
    print(a.lower())
    exit()

Submission status: Wrong Answer

Solution code:
a = open(0).read()        
if 'a' <= a <= 'z':       
    print('a')            
else:                     
    print('A')

Submission status: Wrong Answer

Solution code:
# coding cell (SUBMIT ONLY THIS CELL)

S = input()

if S.islower():
    print(S.upper())
else:
    print(S.lower())

Submission status: Wrong Answer

Solution code:
a = input()

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

Submission status: Wrong Answer

Solution code:
import sys

def II(): return str(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
def RN(N): return [input().strip() for i in range(N)]


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

    
if __name__ == "__main__":
	main()

Submission status: Wrong Answer

Solution code:
x = input()

print(x.lower())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s=input()
if s.islower()==True:
  print(s.upper())
else:
  print(s.lower())

Submission status: Wrong Answer

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

def main():
    s = input()
    if s.isupper():
        print(s.lower())
    else:
        print(s.upper())

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
a = input()
print(a.swapcase())

Submission status: Wrong Answer

Solution code:
import re
a = input()
if re.match("[A-Z]", a):
  print(a.lower())
else:
  print(a.upper())

Submission status: Wrong Answer

Solution code:

import math

for i in range(1):
    s=input()
    print(s.lower())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=input()
if a.islower() : print(a.upper())
else : print(a.lower())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = str(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s=input()

if s>"A":
  print("a")
else:
  print("A")

Submission status: Wrong Answer

Solution code:
s = input()

ans = 0

if s.isupper():
    print(s.lower())
else:
    print(s.upper())

Submission status: Wrong Answer

Solution code:
s=input()

print(s.swapcase())

Submission status: Wrong Answer

Solution code:
A=input()
if A.isupper():
  print(A.lower())
else:
  print(A.upper())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#n = int(input())
#a,b = map(int,input().split())
#a_L = list(map(int,input().split()))
s = input()

if s==s.upper():
    print(s.lower())
else:
    print(s.upper())

Submission status: Wrong Answer

Solution code:
import string
L=string.ascii_lowercase
n=input()
if n in L:
    print(str(n.upper()))
else:
    print(n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if a.islower():
    print(a.upper())
else:
    print(a.lower())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=input()

b=n.upper()
print(b)

Submission status: Wrong Answer

Solution code:
s = input()
print(s.swapcase())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

Solution code:
alpha = str(input())

print(alpha.lower())

Submission status: Wrong Answer

Solution code:
import sys
from collections import deque
import numpy as np
import math
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().split())

def Main():
    a = S()
    if a<'A':
        print('a')
    else:
        print('A')
    print
    return

if __name__=='__main__':
    Main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import copy
from collections import deque
stdin = sys.stdin

mod = 10**9+7

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

s = ns()

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

Submission status: Wrong Answer

Solution code:
t = input()
# nums = map(int, input().split())

if t == t.upper():
	print(t.lower())
else:
	print(t)

Submission status: Wrong Answer

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.lower())
    else:
        print(a)

    return

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

low=s.lower()

if low==s:
    print("A")
else:
    print("B")

Submission status: Wrong Answer

Solution code:
a = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
from itertools import accumulate
from itertools import permutations
from itertools import combinations
from collections import defaultdict
from collections import Counter
import fractions
import math
from collections import deque
from bisect import bisect_left
from bisect import bisect_right
from bisect import insort_left
import itertools
from heapq import heapify
from heapq import heappop
from heapq import heappush
import heapq
from copy import deepcopy
from decimal import Decimal
alf = list("abcdefghijklmnopqrstuvwxyz")
ALF = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
#import numpy as np
INF = float("inf")
#d = defaultdict(int)
#d = defaultdict(list)
c = input()
if c in alf:
    print("a")
else:
    print("A")

Submission status: Wrong Answer

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.lower())
    else:
        print(a.upper())

    return

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(1000000000)
import math
from math import gcd
def lcm(a, b): return a * b // gcd(a, b)
from itertools import count, permutations, chain
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok

def get_inv(n, modp):
    return pow(n, modp-2, modp)

def factorials_list(n, modp):    # 10**6
    fs = [1]
    for i in range(1, n+1):
        fs.append(fs[-1] * i % modp)
    return fs

def invs_list(n, fs, modp):     # 10**6
    invs = [get_inv(fs[-1], modp)]
    for i in range(n, 1-1, -1):
        invs.append(invs[-1] * i % modp)
    invs.reverse()
    return invs

def comb(n, k, modp):
    num = 1
    for i in range(n, n-k, -1):
        num = num * i % modp
    den = 1
    for i in range(2, k+1):
        den = den * i % modp
    return num * get_inv(den, modp) % modp

def comb_from_list(n, k, modp, fs, invs):   
    return fs[n] * invs[n-k] * invs[k] % modp

#

class UnionFindEx:
    def __init__(self, size):
        #正なら根の番号、負ならグループサイズ
        self.roots = [-1] * size
    def getRootID(self, i):
        r = self.roots[i]
        if r < 0:   #負なら根
            return i
        else:
            r = self.getRootID(r)
            self.roots[i] = r
            return r
    def getGroupSize(self, i):
        return -self.roots[self.getRootID(i)]
    def connect(self, i, j):
        r1, r2 = self.getRootID(i), self.getRootID(j)
        if r1 == r2:
            return False
        if self.getGroupSize(r1) < self.getGroupSize(r2):
            r1, r2 = r2, r1
        self.roots[r1] += self.roots[r2]    #サイズ更新
        self.roots[r2] = r1
        return True

Yes = 'Yes'
No = 'No'


def main():
    print(input().lower())

main()

Submission status: Wrong Answer

Solution code:
a = str(input())
print(a.lower())

Submission status: Wrong Answer

Solution code:
s=input()
print(chr(ord(s)+32))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
from collections import defaultdict as dd
from collections import deque as dq
import itertools as it
from math import sqrt, log, log2
from fractions import Fraction

a = input()
print(a.swapcase())

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

Solution code:
a = input()
if a.islower():
    print(a.upper())
else:
    print(a.lower())

Submission status: Wrong Answer

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
alp =['A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z']
a = str(input())
if a in alp:
    print('A')
else:
    print('a')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(1000000)
from collections import deque

N = (input())

if N.isupper():
    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:
s = input()
if s.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:
alpha = input()
print('A' if alpha >= 'A' and alpha <= 'Z' else 'a')

Submission status: Accepted

Solution code:
alp=input()

if alp==alp.upper():
  print("A")
elif alp==alp.lower():
  print("a")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# uppercase = A, lowercase = a

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

Submission status: Accepted

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