n = int(input())
s = input().split()
l = []
for v in s:
    l.append(int(v))
# 遍历l列表,找出最大半径的数,这个数得出的面积一定最大
ma = max(l)
p = ma * ma * 3.14
print('%.2f' % p, end=' ')
for i in range(0, n):
    if l[i] == ma:
        print(i + 1)
        break
/**************************************************************
	Problem: 1813
	User: admin
	Language: Python
	Result: Accepted
	Time:130 ms
	Memory:34480 kb
****************************************************************/