Problem:
 Score : 200 points    Problem Statement Find the largest square number not exceeding N . Here, a square number is an integer that can be represented as the square of an integer.      Constraints  1 \leq N \leq 10^9  N is an integer.         Input Input is given from Standard Input in the following format:  N       Output Print the largest square number not exceeding N .        Sample Input 1 10      Sample Output 1 9  10 is not square, but 9 = 3 × 3 is. Thus, we print 9 .       Sample Input 2 81      Sample Output 2 81       Sample Input 3 271828182      Sample Output 3 271821169

Solution (Python):
n=int(input())
if n==1:
    print(1)
    exit()
for i in range(n):
    if (i+1)**2>n:
        print(i**2)
        break

Solution (Python):
n=int(input())
ans = 1
for i in range(n+100):
  if i**2 > n:
    print(ans)
    break
  else:
    ans=i**2

Solution (Python):
print(int(int(input())**.5)**2)

Solution (Python):
import math
n = int(input())
print((math.floor(n**0.5)**2))

Solution (Python):
from math import sqrt

N = int(input())

print(int(sqrt(N)) ** 2)

Solution (Python):
from math import sqrt

N = int(input())

print(int(sqrt(N)) ** 2)

Solution (Python):
n = int(input())
x = 1
while x * x <= n:
    x += 1

x -= 1
print(x * x)

Solution (Python):
n = int(input())

for i in range(99999):
    if i**2 > n:
        print((i-1)**2)
        exit()

Solution (Python):
import math

n = int(input())

sq = 0
for i in range(n,0,-1):
  sq = math.sqrt(i)
  if sq.is_integer():
    print(i)
    break

Solution (Python):
N = int(input())
max=1
for i in range(1, N):
  if int(i**2)<=N:
    max=i**2
  else:
    break
print(max)

Solution (Python):
print(int(int(int(input())**0.5)**2))

Solution (Python):
print(int(int(input())**0.5)**2)

Solution (Python):


import numpy as np

n=int(input())
for i in range(10**9):
    if(i*i>n):
        print((i-1)**2)
        exit(0)

Solution (Python):
n=int(input())
print(int(n**0.5)**2)

Solution (Python):
from math import sqrt
N = int(input())

for i in range(N, 0, -1):
    if sqrt(i).is_integer():
        break

print(i)

Solution (Python):
import sys
input = sys.stdin.readline
N = int(input())
n = int(N ** (1/2))
print(n ** 2)

Solution (Python):
n = int(input())
print(int(n ** 0.5) ** 2)

Solution (Python):
n=int(input())

print(int(n**0.5)**2)

Solution (Python):
n = int(input())
print(int(n ** 0.5) ** 2)

Solution (Python):
N = int(input())

print(int(N**(1/2))**2)

Solution (Python):
N=int(input())
print(int((N**0.5//1))**2)

Solution (Python):
import math
n = int(input())
print((math.floor(math.sqrt(n))**2))

Solution (Python):
import math
n=int(input())
m=math.floor(math.sqrt(n))
print(m**2)

Solution (Python):
import math

n = int(input())
for i in reversed(range(n+1)):
  if i%(math.sqrt(i)) == 0:
    print(i)
    exit()

Solution (Python):
n=int(input())
print(int((n**.5))**2)

Solution (Python):
import sys
input = sys.stdin.readline
n=int(input())
a=int(n**0.5)
print(a*a)

Solution (Python):
print(int(int(input())**.5)**2)

Solution (Python):
n = int(input())
y = 1
for i in range(1, n):
    if i**2 <= n:
        y = i**2
    else:
        break
print(y)

Solution (Python):
n = int(input())
print(int(n ** 0.5) ** 2)

Solution (Python):
import sys
input = sys.stdin.readline
N = int(input())
i = 1
while i ** 2 <= N:
    i += 1
    if i ** 2 > N:
        print((i - 1) ** 2)
        sys.exit()

Solution (Python):
n = int(input())

for i in range(n):
    if (n-i)**0.5 % 1 == 0:
        print(n-i)
        break

Solution (Python):
import math
N = int(input())
a=int(math.sqrt(N))
for i in range(a+2):
    if i**2 <= N:
        pass
    else:
        print((i-1)*(i-1))
        break

Solution (Python):

import numpy as np

n = int(input())

lis = []
for i in range(40000):
    if i**2 <= 1000000000:    
        lis.append(i**2)

np_lis = np.array(lis)

ans = np_lis[np_lis <= n]

print(ans[-1])

Solution (Python):

n = int(input())
print(int(n**.5)**2)

Solution (Python):

 
import math
import itertools
import sys
import copy
 



N = int(input())

N = N ** 0.5
N = math.floor(N)
print(N**2)

Solution (Python):
for i in range(int(input()), 0, -1):
    if i**(1/2) % 1 == 0:
        print(i)
        break

Solution (Python):
import math
n=int(input())
while(True):
    rootn=math.sqrt(n)//1
    if(n == rootn**2):
        break
    else:
        n-=1
print(n)

Solution (Python):
N = int(input())

for i in range(N, 0, -1):
    if (i ** 0.5).is_integer():
        print(i)
        break

Solution (Python):
n = int(input())

for i in range(n):
    if (n-i)**(0.5)==int((n-i)**(0.5)):
        print(n-i)
        break

Solution (Python):
n=int(input())
print(int(n**0.5)**2)

Solution (Python):

n = int(input())
a = 1
ans = 0

while a ** 2 <= n:
    ans = a ** 2
    a += 1

print(ans)

Solution (Python):
n = int(input())

ans = 1
for i in range(n):
    if i**2 > n:
        break
    ans = max(i**2,ans)
    
print(ans)

Solution (Python):
n=int(input())
i=0
while i**2<=n:
    i+=1
print((i-1)**2)

Solution (Python):
x=int(input())
print(int(x**.5)**2)

Solution (Python):

N = int(input())

ans = 1
for i in range(int(N ** 0.5) + 1):
    if i * i <= N:
        ans = i * i

print(ans)

Solution (Python):
import math
N = int(input())
n = math.sqrt(N)
print(math.floor(n)**2)

Solution (Python):

import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
minans = inf ;ans = 0 ;count = 0 ;pro = 1

n=int(input())
print(int(n**.5)**2)

Solution (Python):
print(int(int(input())**(1/2))**2)

Solution (Python):
a = int(input())
b = int(a**0.5)
print(b*b)

Solution (Python):
import sys

n = int(sys.stdin.readline().rstrip())

def main():
    ans = (n ** 0.5 // 1) ** 2
    return int(ans)

if __name__ == '__main__':
    ans = main()
    print(ans)

Solution (Python):
n = int(input())
print(int(n**.5)**2)

Solution (Python):
n=int(input())
for i in range(n,0,-1):
  if int(i**0.5)**2 == i:
    print(i)
    break

Solution (Python):
n = int(input())

print((int(n ** 0.5)) ** 2)

Solution (Python):
import math
n = int(input())

ans = 0
for i in range(100000):
    if i * i > n:
        break
    ans = i * i

print(ans)

Solution (Python):
a=int(input())
b=int(a**0.5)

print(b**2)

Solution (Python):
import math

n = int(input())
c = n
while c ** 0.5 != int(c ** 0.5):
    c -= 1
print(c)

Solution (Python):
N=int(input())

i=1
while(N>=i*i):
    i+=1

print((i-1)*(i-1))

Solution (Python):
print(int(int(input())**(1/2)) ** 2)

Solution (Python):
n=int(input())
for i in range(100000):
  if i**2>n:
    break
  ans=i**2
print(ans)

Solution (Python):
n=int(input())
for i in range(50000):
  if i**2>n:
    print((i-1)**2)
    break

Solution (Python):
n = int(input())
for i in range(10 ** 5, 0, -1):
    num = i ** 2
    if num <= n:
        print(num)
        exit()

Solution (Python):
N = int(input())
for i in range(N + 2):
    if i ** 2 > N:
        print((i - 1) ** 2)
        exit()

Solution (Python):
import math as m

N = int(input())
print(m.floor(m.sqrt(N)) ** 2)

Solution (Python):
a = int(input())
ans = int(a**0.5)**2
print(ans)

Solution (Python):
import math

N = int(input())

print(int(math.sqrt(N)) ** 2)

Solution (Python):
import math
print(int(math.sqrt(int(input())))**2)

Solution (Python):
n = int(input())

x = 0
while x**2 <= n:
    x += 1

print((x-1)**2)

Solution (Python):
import math


def main(n: int):
    for i in range(n, 0, -1):
        if math.sqrt(i).is_integer():
            print(i)
            break


if __name__ == "__main__":
    n = int(input())

    main(n)

Solution (Python):
print((int((int(input()))**(1/2)))**2)

Solution (Python):
n=int(input())
num=int((n)**(1/2))
print((num)**2)

Solution (Python):
import math
a=int(input())
print((math.floor(a**0.5))**2)

Solution (Python):
import math
s = int(input())
for i in range(s):
    if math.sqrt(s - i).is_integer():
        print(s - i)
        break

Solution (Python):
import math
n = int(input())
for i in range(n * 5000):
  if i * i == n:
    print(i**2)
    break
  elif i * i > n:
    print((i-1) ** 2)
    break

Solution (Python):
n = int(input())
for i in range(int((10**10)**0.5)):
    if i*i > n:
        print((i-1)**2)
        break

Solution (Python):
n = int(input())

for ni in range(n, 0, -1):
  if (ni ** .5).is_integer():
    print(ni)
    exit(0)

Solution (Python):


n =int(input())
print(int(n**0.5)**2)

Solution (Python):
n=int(input())
if n==1:
    print(1)

else:
    for i in range(1,n+1):
        x=i*i
        if x>n:
            print((i-1)*(i-1))
            exit()

Solution (Python):
n = int(input())

for i in range(10**9):
    if i**2 > n:
        print((i-1)**2)
        break

Solution (Python):
N = int(input())
N = N ** (1 / 2)
print(int(N) ** 2)

Solution (Python):
from math import sqrt
n = int(input())
print(int(sqrt(n)) ** 2)

Solution (Python):
import math

def is_integer_num(n):
    if isinstance(n, int):
        return True
    if isinstance(n, float):
        return n.is_integer()
    return False

N=int(input())
answer=1

for i in reversed(range(N+1)):
    if is_integer_num(math.sqrt(i)):
        answer=i
        break

print(answer)

Solution (Python):
n = int(input())

if n == 1:
    print(1)
for i in range(n+1):
    if i ** 2 > n:
        print((i-1)**2)
        import sys
        sys.exit()

Solution (Python):
N=int(input())
print(int(N**0.5)**2)

Solution (Python):
import numpy as np
n = int(input())

root_n = int(np.sqrt(n))

print(root_n**2)

Solution (Python):
n = int(input())

import math

if n <= 3:
	print(1)
else:
	for i in range(n,1,-1):
		k = math.sqrt(i)
		
		if k.is_integer():
			print(i)
			break

Solution (Python):
N=int(input());[exit(0)if i**2>N else print(i**2)if(i+1)**2>N else lambda x:x for i in range(1,N+1)]

Solution (Python):
N=int(input());[exit(0)if i**2>N else print(i**2)if(i+1)**2>N else print(end="")for i in range(1,N+1)]

Solution (Python):

import math
N = int(input())
rootN = int(math.sqrt(N))
r = 0

for i in range(rootN+1):
    if i**2 <= N:
        r = i**2
        
print(r)

Solution (Python):
print(int(int(input())**0.5)**2)

Solution (Python):
n = int(input())
ans = 1
while ans**2 <= n:
    ans += 1
print((ans-1)**2)

Solution (Python):
N = int(input())

for i in range(10 ** 6):
    if i ** 2 > N :
        break 
    ans = i ** 2
print(ans)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import floor, ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy,copy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

def main():
	n = INT()
	for i in range(n, 0,  -1):
		q = floor(sqrt(i))
		if i == q**2:
			print(i)
			sys.exit()

if  __name__=='__main__':
	main()

Solution (Python):
print(int(int(input())**0.5)**2)

Solution (Python):


from math import sqrt,floor

N=int(input())
print(floor(sqrt(N))**2)

Solution (Python):
def main():
    N = int(input())

    i = 0
    while i ** 2 <= N:
        i += 1

    print((i-1)**2)


main()

Solution (Python):
import math
print(math.floor(int(input())**0.5)**2)

Solution (Python):
n=int(input())
print(int(n**0.5)**2)

Solution (Python):
N=int(input())
import math
print(int(math.sqrt(N))**2)

Solution (Python):
import math

N = int(input())
square = math.floor(N ** 0.5)
ans = square ** 2

print(ans)

Solution (Python):
import math
n = int(input())
print(math.floor(math.sqrt(n)) ** 2)

Solution (Python):
N = int(input())
result = 0
for i in range(int(N**0.5)+1):
  if i**2 <= N:
    result = i
  else:
    None
print(result**2)

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

def main():
    n=int(input())
    for i in range(n+1):
        if (i+1)**2>n:
            print(i**2)
            break

main()

Solution (Python):
import math
n = int(input())
s = math.floor(math.sqrt(n))
print(s**2)

Solution (Python):
n=int(input())
count=1
for i in range(n+1):
  if i**2<=n:
    count=i**2
  else:
    break
print(count)

Solution (Python):
import math
N = int(input())
ans = 0
for i in range(int(math.sqrt(N)+1)):
    if i**2 <= N:
        ans = i
print(ans**2)

Solution (Python):
n=int(input())
print(int(n**.5)**2)

Solution (Python):
n=int(input())
for i in range(1,n+1):
  if i*i>n:
    print((i-1)*(i-1))
    exit()
  elif i*i==n:
    print(i*i)
    exit()

Solution (Python):
from sys import stdin
import math
import bisect
import heapq
import numpy as np
from math import factorial

n = int(stdin.readline().rstrip())

print(int(math.sqrt(n))**2)

Solution (Python):
N=int(input())
ans=1
for i in range(1,N):
    if i**2<=N:
        ans=i**2
    else:
        break
print(ans)

Solution (Python):
print(int(int(input())** 0.5)**2)

Solution (Python):
A = int(input())
A = A ** 0.5
A=int(A)
A = A*A
print(A)

Solution (Python):
from math import ceil
N = int(input())

for i in range(ceil((N+1)**0.5), 0, -1):
  if i*i <= N:
    print(i*i)
    break

Solution (Python):
n = int(input())
import math
print(math.floor(math.sqrt(n)) ** 2)

Solution (Python):
N = int(input())
ans = 1
cnt = 1
while(True):
    if(cnt**2 > N):
        ans = (cnt-1)**2
        break
    cnt += 1
print(ans)

Solution (Python):
n=int(input())
sq=n**0.5//1
print(int(sq**2))

Solution (Python):
def examB():
    N = I()
    cur = 1
    for i in range(1,int(N**0.5)+1):
        if N<i**2:
            break
        else:
            cur = i
    ans = cur**2
    print(ans)



import sys,copy,bisect,itertools
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examB()

Solution (Python):
import math
N=int(input())
N_sqrt=int(math.sqrt(N))
print(N_sqrt**2)

Solution (Python):
n=int(input())
m=1
for i in range(100000):
    if i**2<=n:
        m=max(i,m)
print(m**2)

Solution (Python):
n=int(input())
a=[]
for i in range(1,100000):
    if i**2<=n:
        a.append(i)
print((max(set(a)))**2)

Solution (Python):

n = int(input())
the_number = 0

while the_number ** 2 <= n:
    the_number += 1

print((the_number - 1) ** 2)

Solution (Python):
import math
print(int(math.sqrt(int(input())))**2)

Solution (Python):
n = int(input())
ans = 1
for i in range(1,n):
    if i**2 <= n:
        ans = i**2
    else:
        break
print(ans)

Solution (Python):

import math

N = int(input())

print(int(math.sqrt(N)//1)**2)

Solution (Python):
n=int(input())
ans=0
for i in range(1,100000):
    tmp=i*i
    if tmp<=n:
        ans=max(ans,tmp)
print(ans)

Solution (Python):
N = int(input())

ans = 1

for i in range(1,N):
  if i**2 <= N:
    ans = i**2
  else:
    break

print(ans)

Solution (Python):
import math
n = int(input())
print(int(math.pow(int(math.sqrt(n)), 2)))

Solution (Python):
import math
N = int(input())

for i in range(N, -1, -1):
  if  int(math.sqrt(i))**2 == i:
    print(i)
    break

Solution (Python):


n=int(input())
ans=0
if n==1:
    print(1)
else:
    for i in range(1,n):
        if i**2<=n:
            ans=i**2
        else:
            break
    print(ans)

Solution (Python):
import math

n = int(input())
if n == 1:
    print(1)
    exit()
if n == 2:
    print(1)
    exit()
if n == 3:
    print(1)
    exit()
for i in range(int(math.sqrt(n)),1, -1):
    print(i**2)
    exit()

Solution (Python):
from math import sqrt

n = int(input())

t = int(sqrt(n))
print(t**2)

Solution (Python):
n=int(input())
for i in range(n,0,-1):
  if (i ** .5).is_integer():
    print(i)
    exit()

Solution (Python):
n = int(input())
i = 0
ans = 0
while i**2 <= n:
    ans = i**2
    i += 1
print(ans)

Solution (Python):
N = int(input())
ans = 0
for n in range(int(N**0.5)+1):
    if n**2 <= N:
        ans = n**2
print(ans)

Solution (Python):
print(int(int(input())**.5)**2)

Solution (Python):
print(int(int(input())**(1/2))**2)

Solution (Python):
N =int(input())
print(int(N**0.5)**2)

Solution (Python):

import sys

import math



def main():
    n = int(sys.stdin.readline().rstrip())
    ans = math.floor(n ** 0.5) ** 2
    print(ans)
    
if __name__ == "__main__":
    main()

Solution (Python):
N=int(input())
print((int(pow(N,0.5)))**2)

Solution (Python):
N = int(input())
print(int(N**0.5)**2)

Solution (Python):
print(int(int(input())**.5)**2)

Solution (Python):



N = int(input())


i = 1
while i * i <= N:
    i += 1


print((i - 1) ** 2)

Solution (Python):
n = int(input())

for i in range(0,10 ** 9 + 1,1):
    a = i ** 2
    if a > n:
        break
print((i - 1) ** 2)

Solution (Python):
import math
n = int(input())
a = int(math.sqrt(n))

print(a**2)

Solution (Python):
from math import floor
N = int(input())
print(floor(N**(1/2))**2)

Solution (Python):
n = int(input())
print(int(n ** 0.5) ** 2)

Solution (Python):
import math
n = int(input())
for i in range(n+1)[::-1]:
  check_i = math.sqrt(i)
  if check_i.is_integer():
    print(i)
    exit()

Solution (Python):
N=int(input())
ans=1
for i in range(int(N**0.5)+1):
    if i**2<=N:
        ans=i**2
print(ans)

Solution (Python):
print(int(int(input())**0.5)**2)

Solution (Python):
from math import floor

N = int(input())

print(floor(N**(1/2))**2)

Solution (Python):
N = int(input())
flag = None
i = 1
while i**2<=N:
    i += 1
print((i-1)**2)

Solution (Python):
import math
n = int(input())
l = int(math.sqrt(n))
print(l*l)

Solution (Python):
import math
n = int(input())

for i in range(n, 0, -1):
    if math.sqrt(i).is_integer():
        print(i)
        break

Solution (Python):
print(int(int(input())**.5)**2)

Solution (Python):
n = int(input())

print(int(n**0.5)**2)

Solution (Python):
N = int(input())
Answer = 0
for i in range(N+1):
  if (i+1)*(i+1) > N:
    Answer = i**2
    break

print(Answer)

Solution (Python):
n = int(input())
max = 0
num = 1
while (num + 1) ** 2 <= n:
    num += 1
print(num**2)

Solution (Python):
N=int(input())
ans=0
i=0
while ans==0:
    if ((N-i)**0.5).is_integer():
        ans=N-i
    i+=1
print(ans)

Solution (Python):
n = int(input())

list1 = [0]
i = 1
while list1[-1] <= n:
    list1.append(i**2)
    i += 1

print(list1[-2])

Solution (Python):
n=int(input())
print(int(n**0.5)**2)

Solution (Python):
print(int(int(input())**(.5))**2)

Solution (Python):
import numpy as np
n = int(input())

while True:
  if np.sqrt(n) == round(np.sqrt(n)):
    print(int(n))
    break
  else:
    n -= 1

Solution (Python):
import sys
from functools import reduce
import copy
import math
from pprint import pprint
import collections


sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def int_inputs(num_of_input):
    ins = [int(input()) for i in range(num_of_input)]
    return ins


def solve(inputs):
    N = int(inputs[0])
    prev = 0
    for i in range(1, 100000):
        if i * i > N:
            return prev
        prev = i * i


def string_to_int(string):
    return list(map(int, string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

Solution (Python):
n = int(input())
print(int(n**.5)**2)

Solution (Python):
import math
n=int(input())
n2=math.sqrt(n)
n3=math.floor(n2)
print(n3**2)

Solution (Python):
n=int(input())
print(int(n**.5)**2)

Solution (Python):
import math
N = int(input())
rtN = int(math.sqrt(N))
print(rtN*rtN)

Solution (Python):
print(int((int(input()))**0.5)**2)

Solution (Python):
a = int(input())
for i in range(1,10000000):
    if(i*i > a):
        print ((i-1)*(i-1))
        break

Solution (Python):
import math
N=int(input())

ans=(math.sqrt(N)//1)**2
print(int(ans))

Solution (Python):
N=int(input())
i=1
m=0
while i**2 <= N:
  m=i**2
  i=i+1

print(m)

Solution (Python):
n=int(input())
print(int(n**.5)**2)

Solution (Python):

N = int(input())

ans = 0
i = 0
while ans < N:
    ans = (i+1)**2
    if ans > N:
        ans = i**2
        print(ans)
        exit()
    elif ans == N:
        print(ans)
        exit()
    i += 1

Solution (Python):
print(int(int(input())**0.5)**2)

Solution (Python):
n = int(input())
print(int(n**(1/2))**2)

Solution (Python):
n = int(input())
import math
print((math.floor(n**0.5))**2)

Solution (Python):
N = int(input())
if abs(round(N**0.5)-N**0.5)<=1e-8:
    n = round(N**0.5)
else:
    n = int(N**0.5)
print(n**2)

Solution (Python):
n=int(input())
for i in range(1,int(n**(0.5)+1)+1):
    if i**2>n:
        print((i-1)**2)
        break

Solution (Python):
import math
print((int(math.sqrt(int(input()))))**2)

Solution (Python):
n=int(input())
ans=1
for i in range(int(n**(1/2))+1):
	if n >= i**2:
		ans = i**2
print(ans)

Solution (Python):
import math

N = int(input())

while math.sqrt(N) % 1 != 0:
    N -= 1

print(N)

Solution (Python):



def main():



    n = int(input())

    for i in range(10000000):
        if i*i > n:
            print((i-1)*(i-1))
            exit()
        elif i*i==n:
            print(i*i)
            exit()
        



if __name__ == "__main__":
    main()

Solution (Python):
N = int(input())

print(int(N**.5)**2)

Solution (Python):
N=int(input())
ans=1
for i in range(1,100000):
  if i**2<=N:
    ans=i**2
  else:
    break

print(ans)

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    n = int(input().rstrip('\n'))
    print(int(n ** 0.5) ** 2)


if __name__ == '__main__':
    slove()

Solution (Python):
N=int(input())
import math
for i in range(N):
    n=N-i
    if math.sqrt(n) == int(math.sqrt(n)):
        print(n)
        break

Solution (Python):
for n in reversed(range(int(input()) + 1)):
    if pow(n, 1 / 2).is_integer():
        print(n)
        break

Solution (Python):
n = int(input())

ind = 1
next_ = 0
while next_ <= n:
    now = ind**2
    next_ = (ind+1)**2
    ind += 1
print(now)

Solution (Python):
n=int(input())

ans=0
i=1
while (i*i) <= n:
    ans=i*i
    i +=1

print(ans)

Solution (Python):
n=int(input())

a=0
ans=0
for i in range(int(-(-n**0.5//1))+1):
    a +=2*i+1
    if a <= n:
        ans=a

print(ans)

Solution (Python):
n = int(input())
print(int(n**0.5)**2)

Solution (Python):
n = int(input())

for i in range(n + 1):
  if i ** 2 <= n  < (i + 1) ** 2:
    print(i ** 2)
    exit()

Solution (Python):
n = int(input())
print(int(n**.5)**2)

Solution (Python):
n = int(input())

for i in range(1, n+1):
    if i**2 <= n:
        ans = min(n, i**2)
    else:
        break

print(ans)

Solution (Python):
import math
n = int(input())
x = math.floor(n ** 0.5)
print(x ** 2)

Solution (Python):
import math
N = int(input())
ans = 0
for i in range(1, int(math.sqrt(N))+1):
  if(i == int(math.sqrt(i))*int(math.sqrt(i))):
    ans = i
    
print(i*i)

Solution (Python):
N = int(input())
i = 1
while True:
  if i*i <= N:
    i += 1
  else:
    print( (i-1)*(i-1) )
    exit()

Solution (Python):
N = int(input())
for i in range(10**9):
    if i**2 > N:
        print((i-1)**2)
        break

Solution (Python):
import math
N = int(input())
res = 0
for i in range(int(math.sqrt(N))+1):
    val = i**2
    if val > res:
        res = val
print(res)

Solution (Python):
n=int(input())
for i in range(n):
    if (n-i)**0.5%1==0:
        print(n-i)
        break

Solution (Python):
n = int(input())
m = int((n**0.5))**2
print(m)

Solution (Python):
n = int(input())
m = int(n**(1/2))**2
print(m)

Solution (Python):
n = int(input())

for i in range(n, 0, -1):
    if i ** 0.5 == i ** 0.5 // 1:
        print(i)
        exit()

Solution (Python):
N = int(input())
print(int(N ** (1/2)) ** 2)

Solution (Python):
N = int(input())
print(int(N**0.5)**2)

Solution (Python):
N = int(input())
if N < 4:
  print(1)
  exit()
for i in range(N,1,-1):
  if i**0.5 == int(i**0.5):
    print(i)
    exit()

Solution (Python):
import math
import sys
input = sys.stdin.readline


def main():
    N = int(input())
    print(math.floor(math.sqrt(N)) ** 2)                


if __name__ == '__main__':
    main()

Solution (Python):
import math
n = int(input())
print(math.floor(math.sqrt(n))**2)

Solution (Python):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
    n=int(input())
    sqrt=int(n**.5)
    print(sqrt**2)
resolve()

Solution (Python):
n = int(input())
print(int(n ** 0.5)**2)

Solution (Python):
print(int(int(input())**.5)**2)

Solution (Python):
n = int(input())
while True:
  if n**0.5%1 == 0:
    print(n)
    break
  else:
    n -= 1

Solution (Python):
n=int(input())
for i in range(100000):
    x=i**2
    if x>n:
        print((i-1)**2)
        exit()

Solution (Python):
import math

N = int(input())

print(math.floor(math.sqrt(N)) ** 2)

Solution (Python):
import math
print(math.floor(math.sqrt(int(input())))**2)

Solution (Python):
import math

n = int(input())
print(math.floor(math.sqrt(n))**2)

Solution (Python):
n = int(input())
ans = 1
for b in range(1, n + 1):
    if b ** 2 <= n:
        ans = b ** 2
    else:
        break
print(ans)

Solution (Python):
n = int(input())
print(int(int(n**.5)**2))

Solution (Python):
import math
n = int(input())
print((int(math.sqrt(n)))**2)

Solution (Python):
import bisect as bi

M=[i**2 for i in range(1,10**5)]
print(M[bi.bisect_right(M,int(input()))-1])

Solution (Python):
N = int(input())
for i in range(31623, -1, -1):
    if i ** 2 <= N:
        print(i ** 2)
        break

Solution (Python):
print(int(int(input())**.5)**2)

Solution (Python):
import numpy as np
N = int(input())

ans = int(np.sqrt(N))
print(ans ** 2)

Solution (Python):
import math
N = int(input())

sq_n = int(math.sqrt(N))
print(sq_n**2)

Solution (Python):
import math
N = int(input())
print(int(math.sqrt(N))**2)

Solution (Python):
n=int(input())
print(int(n**.5)**2)

Solution (Python):
N = int(input())
print (int(N**(1/2))**2)

Solution (Python):
n = int(input())
res = 1
for i in range(1, n):
    if i**2 > n:
        break
    res = i
print(res**2)

Solution (Python):
from math import sqrt
N = int(input())
ans = 1
for i in range(2, int(sqrt(N))+1):
    ans = max(ans, i**2)
print(ans)

Solution (Python):
n=int(input())
ans=1
if(n==1 or n==2 or n==3):
    ans=1
else:
    for i in range(n):
        i=n-i
        for j in range(3):
            j+=int(i**0.5)-1
            if(i//j==j and i%j==0):
                ans=i
                break
        if(ans!=1):
            break
        
print(ans)

Solution (Python):
import math

n = int(input())

print(math.floor(n ** (0.5)) ** 2)

Solution (Python):
N = int(input())
print(int(N**0.5)**2)

Solution (Python):
n = int(input())
print(int(n ** (1 / 2)) ** 2)

Solution (Python):
print(int(int(input())**0.5) ** 2)

Solution (Python):
n = int(input())
i = 0
while n >= i ** 2:
    i += 1
print((i-1) ** 2)

Solution (Python):
print(int(int(input())**.5)**2)

Solution (Python):
import math
N = int(input())
sqrt_N = math.floor(math.sqrt(N))
print(sqrt_N ** 2)

Solution (Python):
n=int(input())
ans=0
for i in range(1,n+1):
    if i**2<=n:
        ans=i**2
    else:
        print(ans)
        exit()
print(ans)

Solution (Python):
n=int(input())

ans=0

while ans*ans<=n:
    ans+=1
print((ans-1)**2)

Solution (Python):
n=int(input())
i=1
while i**2<=n:
    i+=1
print((i-1)**2)

Solution (Python):
N = int(input().strip())
ans = 1
for i in range(1,N+1):
  s = i**2
  if s <= N:
    ans = s
    continue
  else:
    break
print(ans)

Solution (Python):
import math

N = int(input())

print(int(math.sqrt(N)) ** 2)

Solution (Python):
n = int(input())
ans = 1
res = 0
while True:
    if res <= n:
        ans += 1
        res = ans**2
    else:
        ans -= 1
        res = ans**2
        break
print(res)

Solution (Python):
import sys
import math
from fractions import gcd





def lcm(a, b):
    return a * b // gcd(a, b)

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

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

big_prime = 1000000007

"""


 =  sys.stdin.readline().rstrip()
 =  list(sys.stdin.readline().rstrip())


 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""


N = int(sys.stdin.readline())

print(math.floor(math.sqrt(N)) ** 2)

Solution (Python):
print(int(int(input())**.5)**2)

Solution (Python):
print(int(int(input())**.5)**2)

Solution (Python):
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
    
n=int(input())
c=1
for i in range(n):
 if i**2<=n:
 	c=max(i**2,c)
 else:
 	break
 	
print(c)

Solution (Python):
n=int(input())

limit=int(n**0.5)
ans=0
for i in range(limit+1):
    ans=i**2
print(ans)

Solution (Python):
n = int(input())
print(int(n**(1/2))**2)

Solution (Python):
n = int(input())
for i in range(n+1)[::-1]:
  if pow(i,1/2).is_integer():
    print(i)
    exit()

Solution (Python):
n = int(input())
for pow_n in range(1000000000):
  if pow_n**2 > n:
    print((pow_n - 1)**2)
    break

Solution (Python):
N = int(input())
print(int(N**0.5)**2)

Solution (Python):
x = int(input())
print((int(x ** 0.5)) ** 2)

Solution (Python):
N = int(input())
SQRT = int(N**.5)+1

res = 0
for i in range(1,SQRT+1):
    if i**2 <= N:
        res = i**2
print(res)

Solution (Python):
n=int(input())
print((int(n**0.5))**2)

Solution (Python):
import math
n=int(input())
ans=math.floor(math.sqrt(n))
print(ans**2)

Solution (Python):
import sys
input = sys.stdin.readline

def main():
    N = int(input())
    i = 1
    while pow(i+1, 2) <= N:
        i += 1
    print(i*i)


if __name__ == "__main__":
    main()

Solution (Python):
import math
N=int(input())
n=math.sqrt(N)
 
print(int(n)**2)

Solution (Python):

from math import sqrt
N = int(input())
i = 1
while True:
    if i ** 2 > N:
        print((i-1)**2)
        break
    i += 1

Solution (Python):
def resolve():
    n = int(input())
    print(int(n ** 0.5) ** 2)


if __name__ == "__main__":
    resolve()

Solution (Python):
import math
N=int(input())
n=math.sqrt(N)

print(int(n)**2)

Solution (Python):

import sys


def ILI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def ISI(): return map(int, sys.stdin.readline().rstrip().split())
def II(): return int(sys.stdin.readline().rstrip())
def ISS(): return sys.stdin.readline().rstrip().split()
def IS(): return sys.stdin.readline().rstrip()

N = II()
i = 1
while i**2 <= N:
    i += 1
print((i-1)**2)

Solution (Python):

import sys
import math
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

n = int(input())
print(math.floor(math.sqrt(n))**2)

Solution (Python):
N = int(input())
T = 1

while True:
    T += 1
    if N < T**2:
        break

print((T-1)**2)

Solution (Python):
N =int(input())
a = 1
while a*a<=N:
    a+=1
print((a-1)**2)

Solution (Python):
n = int(input())

from math import sqrt

print(int(sqrt(n)) ** 2)

Solution (Python):
N=int(input())
i=1
while N>=i**2:
    i=i+1
print((i-1)**2)

Solution (Python):
n = int(input())
import math
print(math.floor(math.sqrt(n)) ** 2 )

Solution (Python):
print(int(int(input())**0.5)**2)

Solution (Python):
print(int(int(input())**.5)**2)