Problem:


  MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Min, Max and Sum

Write a program which reads a sequence of $n$ integers $a_i (i = 1, 2, ... n)$, and prints the minimum value, maximum value and sum of the sequence.

Input

  In the first line, an integer $n$ is given. In the next line, $n$ integers $a_i$ are given in a line.

Output

  Print the minimum value, maximum value and sum in a line. Put a single space between the values.

Constraints

$0 < n \leq 10000$

$-1000000 \leq a_i \leq 1000000$

Sample Input

5
10 1 5 4 17

Sample Output

1 17 37



Sample input:
5
10 1 5 4 17


Sample output:
1 17 37

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))

min = 1e9
max = -1e9
sum = 0
for i in range(len(a)):
    if a[i] > max:
        max = a[i]

    if a[i] < min:
        min = a[i]

    sum += a[i]
print(min, max, sum)

Submission status: Accepted

Solution code:
num=int(input())
a=list(map(int,input().split()))
print(min(a),max(a),sum(a))

Submission status: Accepted

Solution code:
def sum(l):
    sum = 0
    for i in l:
        sum += i
    return sum

n = int(input())
l = sorted(map(int, input().split())) 
s = sum(l)
print(l[0], l[-1], s)

Submission status: Accepted

Solution code:
BIG_NUM = 2000000000

N = int(input())

table = list(map(int,input().split()))

maximum = -BIG_NUM
minimum = BIG_NUM
total = 0

for x in table:
    if maximum < x:
        maximum = x
    if minimum > x:
        minimum = x
    total += x

print("%d %d %d"%(minimum,maximum,total))

Submission status: Accepted

Solution code:
_ = input()
l = list(map(int, input().split()))

a = min(l)
b = max(l)
s = sum(l)

print("{} {} {}".format(a, b, s))

Submission status: Accepted

Solution code:
n = int(input())
data = list(map(int, input().split()))
print(min(data), max(data), sum(data))

Submission status: Accepted

Solution code:
#(37)
n=int(input())
ai=list(map(int,input().split()))
0<n<=10000 
n=len(ai)
a=min(ai)
b=max(ai)
c=sum(ai)
print(a,b,c)

Submission status: Accepted

Solution code:
n = int(input())
l = list(map(int, input().split()))
print(min(l),max(l),sum(l))

Submission status: Accepted

Solution code:
n = input()
a = list(map(int,input().split()))

print(min(a),max(a),sum(a))

Submission status: Accepted

Solution code:
BIG_NUM = 2000000000
N = int(input())

table = list(map(int,input().split()))

maximum = -BIG_NUM
minimum = BIG_NUM
total = 0

for x in table:
    if maximum < x:
        maximum = x
    if minimum > x:
        minimum = x
    total += x

print("%d %d %d"%(minimum,maximum,total))

Submission status: Accepted

Solution code:
a = input()
b = list(map(int,input().split()))
print(min(b),max(b),end=" ")
taiga = 0
for i in b :
    taiga += i
print(taiga)

Submission status: Accepted

Solution code:
import sys
from itertools import combinations
import math


def I(): return int(sys.stdin.readline().rstrip())


def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))


def S(): return sys.stdin.readline().rstrip()


def LS(): return list(sys.stdin.readline().rstrip().split())


n = I()
s = LI()

s.sort()
print(s[0], s[-1], sum(s))

Submission status: Accepted

Solution code:
n = int(input())
int_list = list(map(int, input().split()))

print(f"{min(int_list)} {max(int_list)} {sum(int_list)}")

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))

a.sort()

print(a[0], a[-1], sum(a))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))


min=min(a)

max=max(a)
    
sum=sum(a)

print(str(min)+' '+str(max)+' '+str(sum))

Submission status: Accepted

Solution code:
n = input()
roro = list(map(int, input().split()))
print(min(roro),max(roro),sum(roro))

Submission status: Accepted

Solution code:
n = int(input())
b = list(map(int, input().split()))

print(min(b),max(b),sum(b))

Submission status: Accepted

Solution code:
n=int(input())
x=[int(i) for i in input().split()]

a=min(x)
b=max(x)
c=sum(x)
print(a,b,c)

Submission status: Accepted

Solution code:
x=input()
data=list(map(int,input().split()))
a=min(data)
b=max(data)
c=sum(data)
print(a,b,c)

Submission status: Accepted

Solution code:
n=int(input())
x=list(map(int,input().split()))

a = min(x)
b = max(x)  
c = sum(x)  


print(a,b,c)

Submission status: Accepted

Solution code:
n = int(input())

a = list(map(int,input().split()))
min_a = min(a)
max_a = max(a)
sum_a = sum(a)
print(min_a, max_a, sum_a)

Submission status: Accepted

Solution code:
N = int(input())
nums = sorted(map(int, input().split()))
print(nums[0], nums[N - 1], sum(nums))

Submission status: Accepted

Solution code:

x = int(input())
a = list(map(int,input().split()))
#for i in range(x):
 #   a = int(input())
#    a = list(map(int,input().split()))
#a = [input().split() for l in range(x)]
#for i in range(x):
 #   a , b , c = list(map(int,input().split()))
  #  lst = [32, 14, 2, 17, 48, 50, 15, 24, 46, 8]
   # a = min(lst)
    #b = max(lst)
    #c = sum(lst)
#print(a)

x = min(a)
y = max(a)
z = sum(a)
print(x,end=' ')
print(y,end=' ')
print(z)
#    print(min(a))
#    print(max(a))
#    print(sum(a))

Submission status: Accepted

Solution code:
n=int(input())
data=list(map(int,input().split()))
print(min(data),max(data),sum(data))

Submission status: Accepted

Solution code:
input()

nums = list(map(int, input().split()))

print(min(nums), max(nums), sum(nums))

Submission status: Accepted

Solution code:
n = int(input())
list_num = [int(_) for _ in input().split(" ")]

min_num = min(list_num)
max_num = max(list_num)
sum_num = sum(list_num)

print(f"{min_num} {max_num} {sum_num}")

Submission status: Accepted

Solution code:
n = int(input())

data = list(map(int, input().split()))
if n == len(data):
    print("{} {} {}".format(min(data), max(data), sum(data)))
else:
    print("error")

Submission status: Accepted

Solution code:
n = int(input())
lst = list(map(int, input().split()))
a = min(lst)
b = max(lst)
c = sum(lst)
print(a, b, c)

Submission status: Accepted

Solution code:
n = int(input())
alist = list(map(int,input().split(" ")))
alist.sort()
amin = alist[0]
amax = alist[n-1]
asum = sum(alist)
print(amin,amax,asum)

Submission status: Accepted

Solution code:
n = int(input())
nums = [int(x) for x in input().split()]
print(min(nums), max(nums), sum(nums))

Submission status: Accepted

Solution code:
n=input()
s = list(map(int,input().split()))
print(min(s),max(s),sum(s))

Submission status: Accepted

Solution code:
n =int(input())
a=list(map(int, input().split()))
print(min(a), max(a), sum(a))

Submission status: Accepted

Solution code:
n = int(input())
ls = list(map(int,input().split()))
print("{} {} {}".format(min(ls),max(ls),sum(ls)))

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))

print(min(a), max(a), sum(a))

Submission status: Accepted

Solution code:
import sys

n = int(input())
a = list(map(int, input().split()))
    
print(f"{min(a)} {max(a)} {sum(a)}")

Submission status: Accepted

Solution code:
a = int(input())
b = list(map(int, input().split(' ')))
mx = max(b)
mn = min(b)
t = 0
for i in b:
    t = t + i
print(mn,mx,t)

Submission status: Accepted

Solution code:
N = int(input())
a = [int(x) for x in input().split()]
print(str(min(a)) + ' ' + str(max(a)) + ' ' + str(sum(a)))

Submission status: Accepted

Solution code:
a = int(input())
b = list((map(int,input().split())))

x = min(b)
y = max(b)
z = sum(b)

print('{} {} {}'.format(x,y,z))

Submission status: Accepted

Solution code:
n=int(input())
x=input().split()
for i in range(n):
    x[i]=int(x[i])
a=max(x)
b=min(x)
sum=0
for j in range(n):
    sum+=int(x[j])
    j+=1
print(b,a,sum)

Submission status: Accepted

Solution code:
n = input()
a = sorted(map(int,input().split()))

print("{} {} {}".format(a[0],a[-1],sum(a)))

Submission status: Accepted

Solution code:
n = int(input())
array = list(map(int, input().split()))

print(min(array), max(array), sum(array))

Submission status: Accepted

Solution code:
N = int(input())
a = list(int(i) for i in input().split())
print(f'{min(a)} {max(a)} {sum(a)}')

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

def main():
    a = int(input())
    s = list(map(int, input().split()))
    s.sort()
    
    print(s[0], s[a-1], sum(s))
    
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n=int(input())
x=list(map(int,input().split()))
print(min(x),max(x),sum(x))

Submission status: Accepted

Solution code:
n = int(input())
i = list(map(int, input().split()))

a = min(i)
b = max(i)
c = sum(i)
    
print(a, b, c)

Submission status: Accepted

Solution code:
n = input()
nums = list(map(int,input().split()))

a = min(nums)

b = max(nums)

c = sum(nums)

print("{0} {1} {2}".format(a,b,c))

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
b=min(a)
c=max(a)
d=sum(a)
print(b,c,d)

Submission status: Accepted

Solution code:
a = int(input())
b = list(map(int,input().split()))

bmin = min(b)
bmax = max(b)
bsum = sum(b)

print(bmin, bmax, bsum)

Submission status: Accepted

Solution code:
n=int(input())
#a=[int(input()) for i in range(n)]
a=list(map(int,input().split()))
#print(a)
print(min(a),end=' ')
print(max(a),end=' ')
x=0
for i in range(n):
    x+=a[i]
print(x)

Submission status: Accepted

Solution code:
n=int(input())
ai=list(map(int, input().split()))
print(min(ai),max(ai),sum(ai))

Submission status: Accepted

Solution code:
x=int(input())
s=list(map(int,input().split()))

i=0
j=0
z=0

for i in range(x):
    z+=s[i]



print(min(s),max(s),z)

Submission status: Accepted

Solution code:
n = int(input())
a_list = list(map(int, input().split()[:n]))

print(min(a_list), max(a_list), sum(a_list))

Submission status: Accepted

Solution code:
n=int(input())
A=[int(i) for i in input().split()]
print(min(A),max(A),sum(A))

Submission status: Accepted

Solution code:




n=input()

ls=list(map(int,input().split()))

print(min(ls),max(ls),sum(ls))

Submission status: Accepted

Solution code:
n=int(input())
num_str=input().split()
list=list(map(int,num_str))
print(f'{min(list)} {max(list)} {sum(list)}')

Submission status: Accepted

Solution code:
n = int(input())

a = list(map(int,input().split()))

max = a[0]
min = a[0]
sum = a[0]

for i in range(1,n):
    if max < a[i]:
        max = a[i]
    elif min > a[i]:
        min = a[i]
    sum += a[i]
print(min,max,sum)

Submission status: Accepted

Solution code:
n=int(input())
lis=[int(x) for x in input().split()]
print(min(lis),max(lis),sum(lis))

Submission status: Accepted

Solution code:
n = int(input())
num_list = list(map(int, input().split()))

max_num = max(num_list)
min_num = min(num_list)
sum_num = sum(num_list)
print(min_num, max_num, sum_num)

Submission status: Accepted

Solution code:
n = int(input())
A = list(map(int, input().split()))

ans = [min(A), max(A), sum(A)]
print(*ans)

Submission status: Accepted

Solution code:
n = input()
l = list(map(int, input().split()))
print(min(l), max(l), sum(l))

Submission status: Accepted

Solution code:
x = input()
a = list(map(int, input().split()))
print(min(a), max(a), sum(a))

Submission status: Accepted

Solution code:
n = int(input())

a = list(map(int, input().split()))

print("{} {} {}".format(min(a), max(a), sum(a)))

Submission status: Accepted

Solution code:
i=int(input())
lst=list(map(int,input().split()))
a=min(lst)
b=max(lst)
c=sum(lst)
print(a,b,c)

Submission status: Accepted

Solution code:
n = int(input())

a = list(map(int, input().split()))

print(min(a), max(a), sum(a))

Submission status: Accepted

Solution code:
n = int(input())
x = list(map(int,input().split()))

print(min(x),max(x),sum(x))

Submission status: Accepted

Solution code:
N = int(input())
L = list(map(int, input().split()))

mn = min(L)
mx = max(L)
sm = sum(L)

print(mn,mx,sm)

Submission status: Accepted

Solution code:
n = input()
m = list(map(int,input().split()))
m1 = max(m)
m2 = min(m)
m3 = sum(m)
print (m2,m1,m3)

Submission status: Accepted

Solution code:
n=int(input())
table=list(map(int,input().split()))
print(min(table),max(table),sum(table))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
a.sort()
m = 0
for i in a:
    m += i
print(a[0],a[-1],m)

Submission status: Accepted

Solution code:
input()
l=list(map(int,input().split()))
print(min(l),max(l),sum(l))

Submission status: Accepted

Solution code:
x = int(input())
lst=[]
x=len(lst)
lst = list(map(int,input().split()))
print(min(lst),max(lst),sum(lst),sep=" ")

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
a.sort()
sum=0
for i in range(n):
    sum+=a[i]
print(f'{a[0]} {a[i]} {sum}')

Submission status: Accepted

Solution code:
a=int(input())
b=list(map(int,input().split()))
c = min(b)
d = max(b)   
e = sum(b)  
print(c,d,e)

Submission status: Accepted

Solution code:
n = input()
x = list(map(int,input().split()))
a = min(x)
b = max(x)
c = sum(x)
print(a,b,c)

Submission status: Accepted

Solution code:
N = int(input())
num_list = list(map(int,input().split()))

print(min(num_list),max(num_list),sum(num_list))

Submission status: Accepted

Solution code:
n = int(input())
data = list(map(int,input().split()))
a = min(data)
b = max(data)
c = sum(data)

print(a, b, c)

Submission status: Accepted

Solution code:
n = int(input())

a = list(map(int,input().split()))

ma = -1000000
mi = 1000000
t = 0

for i in a:
        if ma < i:
                ma = i

        if mi > i:
                mi = i

        t += i

print (mi, ma, t)

Submission status: Accepted

Solution code:
n=input()
while True:
    try:
        x=list(map(int,input().split()))
        a = min(x)   
        b = max(x)   
        c = sum(x)
        print(a,b,c)
    except:
        break;

Submission status: Accepted

Solution code:
n=int(input())
num_list=list(map(int,input().split()))
print(min(num_list),max(num_list),sum(num_list))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
print(min(a),max(a),sum(a))

Submission status: Accepted

Solution code:
n = int(input())

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

print(min(l),max(l),sum(l))

Submission status: Accepted

Solution code:
input()
l = list(map(int,input().split()))
print(min(l),max(l),sum(l))

Submission status: Accepted

Solution code:
n = int(input())
ai = map(int, input().split())
max = -9999999
min = 9999999
sum = 0
for i in ai:
    if i > max:
        max = i
    if i < min:
        min = i
    sum += i

print(min, max, sum)

Submission status: Accepted

Solution code:
num = int(input())

x = map(int, input().split())
x = list(x)

min = min(x)
max = max(x)
sum = sum(x)

print(min, max, sum)

Submission status: Accepted

Solution code:
n=int(input())
tensu=[None]*n
tensu=list(map(int,input().split()))
total=0
for i in range(n):
    total+=tensu[i]
a=tensu[0]
i=0
while i<n:
    if a>tensu[i]:
        a=tensu[i]
        i+=1
    else:
        i+=1
b=tensu[0]
i=0
while i<n:
    if b<tensu[i]:
        b=tensu[i]
        i+=1
    else:
        i+=1
print(str(a)+' '+str(b)+' '+format(total))

Submission status: Accepted

Solution code:
def sum(list):
    r = 0
    for i in list:
        r += i
    return r

n = int(input())
list1 = list(map(int, input().split()))
max_result = max(list1)
min_result = min(list1)
sum_result = sum(list1)

print(min_result, max_result, sum_result)

Submission status: Accepted

Solution code:
n = int(input())
line=input()
a=[]
t = line.split(" ")
for i in range(0,n):
    a.append(int(t[i]))
print(min(a),max(a),sum(a))

Submission status: Accepted

Solution code:
n=int(input())
list=list(map(int,input().split()))
print(min(list),max(list),sum(list))

Submission status: Accepted

Solution code:
N=int(input())
a=list(map(int,input().split()))

print(min(a),max(a),sum(a))

Submission status: Accepted

Solution code:
input()
nums = list(map(int, input().split()))
a = min(nums)
b = max(nums)
c = sum(nums)
print(a, b, c)

Submission status: Accepted

Solution code:
# coding: utf-8
# 37

n = int(input())
A = list(map(int,input().split()))
#print(A)

print(min(A),max(A),sum(A))

Submission status: Accepted

Solution code:
num = int(input())
table = list(map(int,input().split()))

M = max(table)
m = min(table)
s = sum(table)

print(m,M,s)

Submission status: Accepted

Solution code:
def calculate():
    n = int(input())
    data = list(map(int, input().split()))
    return min(data), max(data), sum(data)

a, b, c = calculate()
print(a, b, c)

Submission status: Accepted

Solution code:
n=int(input())
a=[int(i) for i in input().split()]
print(min(a),max(a),sum(a))

Submission status: Accepted

Solution code:
n = int(input())
x = list(map(int, input().split()))
print(min(x), max(x), sum(x))

Submission status: Accepted

Solution code:
n = int(input())
data = list(map(int,input().split()))
a = min(data)
b = max(data)
c = sum(data)
print(a, b, c)

Submission status: Accepted

Solution code:
n = int(input())
a = [int(x) for x in input().split()]
print(f'{min(a)} {max(a)} {sum(a)}')

Submission status: Accepted

Solution code:
n=int(input())
a =list(map(int,input().split()))
s=0
for i in range(n):
    s+=a[i]
m=min(a)
M=max(a)
print(m,M,s)

Submission status: Accepted

Solution code:
num = int(input())
data = list(map(int,input().split()))

print(min(data), max(data),sum(data))

Submission status: Accepted

Solution code:
def min_max_sum(a):
    return min(a), max(a), sum(a)


if __name__ == '__main__':
    n = int(input())
    input_list = list(map(int, input().split()))
    ans1, ans2, ans3 = min_max_sum(input_list)
    print(ans1, ans2, ans3)

Submission status: Accepted

Solution code:
_ = input()
var = input()
array = list(map(int,var.split()))
print('{} {} {}'.format(min(array),max(array),sum(array)))

Submission status: Accepted

Solution code:
n = int(input())
list = [int(a) for a in input().split()]

m = min(list)
M = max(list)

S = 0
for i in range(n):
    S = S + list[i]

print(m, M, S)

Submission status: Accepted

Solution code:
n  = int(input())
data  = list(int(i) for i in input().split())
data_min = min(data)
data_max = max(data)
data_sum = sum(data)
print(data_min,data_max,data_sum)

Submission status: Accepted

Solution code:
n = input()
a = list(map(int, input().split()))

print(min(a), max(a), sum(a))

Submission status: Accepted

Solution code:
x=int(input())
num=list(map(int,input().split()))
y=sorted(num)
s=y[0]
t=y[(x-1)]
u=sum(num)
print(s,t,u)

Submission status: Accepted

Solution code:
n=int(input())
l=list(map(int,input().split()))#空白区切りの数字をlist型で入力
print(min(l),max(l),sum(l))

Submission status: Accepted

Solution code:
n = int(input())
data = list(map(int,input().split()))
0 <= n <=10000

data_max = max(data)
data_min = min(data)
data_sum = sum(data)

print(data_min, data_max, data_sum)

Submission status: Accepted

Solution code:
x=input()
lst = input().split()
i=0
while i<int(x) :
    lst[i]=int(lst[i])
    i=i+1
a = min(lst)  
b = max(lst)   
c = sum(lst) 
print(a,b,c)

Submission status: Accepted

Solution code:
n = int(input())
lis = list(map(int,input().split()))

print(min(lis),max(lis),sum(lis))

Submission status: Accepted

Solution code:
N = int(input())
a = [int(x) for x in input().split()]

print("%d %d %d" %(min(a),max(a),sum(a)))

Submission status: Accepted

Solution code:
n=int(raw_input())
a=map(int,raw_input().split())
print min(a),max(a),sum(a)

Submission status: Accepted

Solution code:
n=int(input())
x=list(map(int,input().split()))
print(min(x),max(x),sum(x))

Submission status: Accepted

Solution code:
import math

a = input()
table = list(map(int, input().split()))

print(min(table), max(table), sum(table))

Submission status: Accepted

Solution code:
n=int(input())
x=input().split()

x=[int(i) for i in x]
    
print(min(x), max(x), sum(x))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))

max = a[0]
min = a[0]
sum_a = 0

for i in a:
    sum_a += i
    if max < i:
        max = i
    if min > i:
        min = i
        
print('{} {} {}'.format(min, max, sum_a))

Submission status: Accepted

Solution code:
n=int(input())
x=[int(i) for i in input().split()]
a=min(x)
b=max(x)
c=sum(x)

print(a,b,c)

Submission status: Accepted

Solution code:
n=int(input())
t=list(map(int,input().split()))
a=min(t)
b=max(t)
c=sum(t)

print(a, b, c)

Submission status: Accepted

Solution code:
n = int(input())
table = list(map(int, input().split()))

print("%d %d %d" %(min(table), max(table), sum(table)))

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
n=int(input())
i=list(map(int,input().split()))

nmax=max(i)
nmin=min(i)
nsum=sum(i)

print(nmin,nmax,nsum)

Submission status: Accepted

Solution code:
_ = input()
nums = list(map(int, input().split()))

print(min(nums), max(nums), sum(nums))

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))

i=0
max=a[0]
min=a[0]
sum=0
while i<=n-1:
    if max<a[i]:
        max=a[i]
    
    if min>a[i]:
        min=a[i]
    
    sum+=a[i]
    i+=1
    
print(min, max, sum)

Submission status: Accepted

Solution code:
N = int(input())
list = [int(i) for i in input().split()]
print(min(list),max(list),sum(list))

Submission status: Accepted

Solution code:
_ = int(input())
args = [int(arg) for arg in input().split()]
print(str(min(args)), str(max(args)), str(sum(args)))

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))

print(min(A), max(A), sum(A))

Submission status: Accepted

Solution code:
n = int(input())
lst = list(map(int,input().split()))
a = min(lst)
b = max(lst)
c = sum(lst)
print(a , b , c)

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
min=1000000
max=-1000000
sum=0
for i in a:
    if i<min:
        min=i
    if max<i:
        max=i
    sum+=i
print(min,max,sum)

Submission status: Accepted

Solution code:
input();*a,=map(int,input().split());print(min(a),max(a),sum(a))

Submission status: Accepted

Solution code:
n = input()
Input = list(map(int, input().split()))
print(min(Input),max(Input),sum(Input))

Submission status: Accepted

Solution code:
def test_case():
    n = int(input())
    n_list = list(map(int, input().split()))
    n_min, n_max, n_sum = 0, 0, 0
    for i in range(n):
        if n_min == 0:
            n_min = n_list[i]
        elif n_min > n_list[i]:
            n_min = n_list[i]

        if n_max == 0:
            n_max = n_list[i]
        elif n_max < n_list[i]:
            n_max = n_list[i]

        n_sum += n_list[i]
    print(n_min, n_max, n_sum)


if __name__ == "__main__":
    test_case()

Submission status: Accepted

Solution code:
n = int(input())

list = [int(x) for x in input().split()]

print(str(min(list)) + ' ', end='')
print(str(max(list)) + ' ', end='')
print(str(sum(list)))

Submission status: Accepted

Solution code:
n = int(input())
li = list(map(int,input().split()))

maxv = max(li)
minv = min(li)
sumv = sum(li)

print(minv,maxv,sumv)

Submission status: Accepted

Solution code:
n = int(input())
x = list(map(int, input().split()))
print(min(x), max(x), sum(x))

Submission status: Accepted

Solution code:
n = int(input())
lis = list(map(int, input().split()))

print(min(lis), max(lis), sum(lis))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int,input().split()))
print(f"{min(a)} {max(a)} {sum(a)}")

Submission status: Accepted

Solution code:
a=int(input())
list=list(map(int,input().split()))
print(min(list),max(list),sum(list))

Submission status: Accepted

Solution code:
input_num = int(input())
input_list = list(map(int, input().split()))
print('{} {} {}'.format(min(input_list), max(input_list), sum(input_list)))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split())) 

print(min(a), max(a), sum(a))

Submission status: Accepted

Solution code:
n = int(input())
ns = list(map(int, input().split()))
nmax = max(ns)
nmin = min(ns)
nsum = sum(ns)
print("%d %d %d" %(nmin, nmax, nsum))

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    l = [int(e) for e in input().split()]
    print(min(l), max(l), sum(l))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = input()
a = input().split()
b = [int(each) for each in a]

print('{} {} {}'.format(min(b),max(b),sum(b)))

Submission status: Accepted

Solution code:
n = int(input())
lis = list(map(int,input().split()))

lis.sort()
print(lis[0], lis[n-1], sum(lis))

Submission status: Accepted

Solution code:
cnt = int(input())
li = list(map(int,input().split()))
print(min(li),max(li),sum(li))

Submission status: Accepted

Solution code:
x = input()


def f(x):
    t = list(map(int, input().split()))
    return f'{min(t)} {max(t)} {sum(t)}'


u = f(x)
print(u)

Submission status: Accepted

Solution code:
e = int(input())
data = list(map(int, input().split()))
a = min(data)
b = max(data)
c = sum(data)
print(a, b, c)

Submission status: Accepted

Solution code:
sum_value = 0
max_value = 0
min_value = 0
count = 0
while True:
    count += 1
    if count == 1:
        n = int(input())
    if count == 2:
        a = map(int, input().split())
        for i, item in enumerate(a):
            if i == 0:
                max_value, min_value = item, item
            sum_value += item
            if max_value < item : max_value = item
            if min_value > item : min_value = item
        print (f'{min_value} {max_value} {sum_value}')
        break

Submission status: Accepted

Solution code:
n = int(input())
Ai = list(map(int, input().split()))
print(min(Ai), max(Ai), sum(Ai))

Submission status: Accepted

Solution code:
def main():
    _ = int(input())
    nums = list(map(int, input().split()))
    a = min(nums)
    b = max(nums)
    c = sum(nums)
    print(f"{a} {b} {c}")
    return 0


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int,input().split()))
a_min = min(a)
a_max = max(a)
a_sum = sum(a)

print(a_min,a_max,a_sum)

Submission status: Accepted

Solution code:
n = int(input())
arr = list(map(int, input().split()))
print(min(arr), max(arr), sum(arr))

Submission status: Accepted

Solution code:
input()
N = list(map(int, input().split()))
print(min(N), max(N), sum(N))

Submission status: Accepted

Solution code:
n = int(input())
arr = list(map(int,input().split()))
print(min(arr), max(arr), sum(arr))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int,input().split()))
mins = min(a)
maxs = max(a)
sums = sum(a)
print(mins,maxs,sums)

Submission status: Accepted

Solution code:
n=int(input())
num=list(map(int,input().split()))
num.sort()
print('{0} {1} {2}'.format(num[0],num[-1],sum(num)))

Submission status: Accepted

Solution code:
n = int(input())
lst = list(map(int, input().split()))
print(min(lst), max(lst), sum(lst))

Submission status: Accepted

Solution code:
n = int(input())
Inlist = list(map(int, input().split()))

print(min(Inlist), max(Inlist), sum(Inlist), sep=' ')

Submission status: Accepted

Solution code:
N=input()

res=[int(x) for x in input().split()]

print(min(res),max(res),sum(res))

Submission status: Accepted

Solution code:
n=int(input())
table=list(map(int,input().split()))

tmax=max(table)
tmin=min(table)
tsum=sum(table)

print(tmin,tmax,tsum)

Submission status: Accepted

Solution code:
_ = input()

seq = list(map(int, input().split()))

print(min(seq), max(seq), sum(seq))

Submission status: Accepted

Solution code:
n = int(input())
list_ = list(map(int, input().split()))

print(min(list_), max(list_), sum(list_))

Submission status: Accepted

Solution code:
_ = int(input())
lst = list(map(int, input().split()))

print(min(lst), max(lst), sum(lst))

Submission status: Accepted

Solution code:
n=int(input())
a = list(map(int, input().split()))
x=max(a)
y=min(a)
z=sum(a)
print(y,x,z)

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))

sum = 0
for i in range(n):
  sum += a[i]

a.sort()

print(a[0], a[n-1], sum)

Submission status: Accepted

Solution code:
n = int(input())
nums = [int(i) for i in input().split()]
print(min(nums),max(nums),sum(nums))

Submission status: Accepted

Solution code:
n = int(input())
ain = [0]* n
ain = map(int, input().split())
a = list(ain)         
print(min(a), max(a), sum(a))

Submission status: Accepted

Solution code:
n = input()
a = list(map(int, input().split()))
print(min(a), max(a), sum(a))

Submission status: Accepted

Solution code:
n=int(input())
s=list(map(int,input().split()))
s=sorted(s)
print(str(s[0])+" "+str(s[-1])+" "+str(sum(s)))

Submission status: Accepted

Solution code:
def min_max_sum(a_list):
    return min(a_list), max(a_list), sum(a_list)


n = input()
a_list = list(map(int, input().split()))

min, max, sum = min_max_sum(a_list)

print(min, max, sum)

Submission status: Accepted

Solution code:
n= int(input())
num_list=list(map(int,input().split()))

sum=0
for i in range(len(num_list)):
    sum+=num_list[i]

print(min(num_list), max(num_list), sum)

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))

print("{} {} {}".format(min(a), max(a), sum(a)))

Submission status: Accepted

Solution code:
z = input()
lst = list(map(int, input().split()))

print(min(lst), max(lst), sum(lst))

Submission status: Accepted

Solution code:
n = int(input())
Lists = list(map(int, input().split()))

print(min(Lists),end=" ")
print(max(Lists),end=" ")
print(sum(Lists))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
print('{0} {1} {2}'.format(min(a), max(a), sum(a)))

Submission status: Accepted

Solution code:
n = int(input())
l = list(map(int,input().split()))
print(min(l),max(l),sum(l))

Submission status: Accepted

Solution code:
n = int(input())
x = list(map(int,input().split()))
x.sort()
print(x[0],x[n-1],sum(x))

Submission status: Accepted

Solution code:
n = int(input())
A = [int(a) for a in input().split()]

print(min(A), max(A), sum(A))

Submission status: Accepted

Solution code:
N = int(input())
table = list(map(int, input().split()))

BIG_N = 200000000000
total = 0
maximum = -BIG_N
minimum = BIG_N

for i in table:
    if i > maximum:
        maximum = i
    if i < minimum:
        minimum = i
    total += i
    
print(f"{minimum} {maximum} {total}")

Submission status: Accepted

Solution code:
n = input()
arr = list(map(int, input().split())) 

# sums = 0
# for i in range(n):
#     sums += arr[i]

print(min(arr), max(arr), sum(arr))

Submission status: Accepted

Solution code:
n = int(input())

seq = list(map(int, input().split()))
seq = seq[:n]
minimum =  min(seq)
maximum = max(seq)
total = sum(seq)

print (minimum, maximum, total)

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int,input().split()))
print("%d %d %d" % (min(a),max(a),sum(a)))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int,input().split()))
a.sort()
print(f"{a[0]} {a[n-1]} {sum(a)}")

Submission status: Accepted

Solution code:
input()
l = list(map(int, input().split()))
print(min(l), max(l), sum(l))

Submission status: Accepted

Solution code:
n = int(input())
nl = list(map(int, input().split()))

print('{} {} {}'.format(min(nl), max(nl), sum(nl)))

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int, input().split(" ")))

print(min(a), max(a), sum(a))

Submission status: Accepted

Solution code:
n=int(input())
A=list(map(int,input().split()))
A.sort()
print(A[0],A[n-1],sum(A))