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())
n = int(N**0.5)
print(int(n**2))

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

Solution (Python):
import math
n = int(input())
while n > 0:
    if math.sqrt(n) == int(math.sqrt(n)):
        print(n)
        exit()
    n -= 1

Solution (Python):
import sys
sys.setrecursionlimit(10**6)
import math

N = int(input())
ans = 1
for i in range(int(math.sqrt(N)+1.1)):
    if i*i <= N:
        ans = max(ans,i*i)

print(ans)

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

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

for i in range(1, 10**6):
    if i**2 > N:
        print((i-1)**2)
        exit()

Solution (Python):
import math

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

Solution (Python):
from decimal import Decimal
n=int(input())
print(int(Decimal(n).sqrt())**2)

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

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

Solution (Python):
from math import ceil, sqrt

N = int(input())
M = ceil(sqrt(N))
if M ** 2 <= N:
    print(M ** 2)
else:
    print((M - 1) ** 2)

Solution (Python):
import math
n=int(input())
ans=n
for i in range(n):
    num=math.sqrt(ans)
    if num%1==0:
        break
    ans-=1
print(ans)

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

m = int(n**(0.5))

print(m*m)

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

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

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

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

for i in range(n, 0, -1):
    if (i**0.5).is_integer():
        print(i)
        sys.exit()

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

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

i=0
while (n-i)**0.5 % 1 != 0:
    i+=1
print(n-i)

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

Solution (Python):
n=int(input())
print(int(n**.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())
ans = 1
while ans**2 <= n:
    if ans**2 <= n: ans += 1
print((ans-1)**2)

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

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

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

while True:
    if math.sqrt(N) % 1 == 0:
        print(N)
        exit()
    N -= 1

Solution (Python):
import numpy as np
n = int(input())
for i in range(n, 0, -1):
    if np.sqrt(i) % 1 == 0:
        print(i)
        break

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

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

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

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

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

for i in range(1,10**10):
  if i**2 <= n:
    count = i**2
  else:
    print(count)
    exit()

Solution (Python):
import math
n=int(input())
sum=n
for i in range(1,n):
    if n >= i*i:
        sum = i*i
    else:
        break
print(sum)

Solution (Python):


import sys

import math




























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    n = ii()
    candidate = int(math.sqrt(n))
    print(candidate**2)



if __name__ == "__main__":
    main()

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

n = int(readline())
ans = int(n** 0.5)**2
print(ans)

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

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

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

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

ans = 0

for a in range(10**5 + 1):
    if a**2 <= n:
        ans = max(ans, a**2)

print(ans)

Solution (Python):
import math

n = int(input())

ans = 0

for a in range(10**5 + 1):
    if a**2 <= n:
        ans = max(ans, a**2)

print(ans)

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

Solution (Python):
n=int(input())
ans=0
for i in range(1,int(n**0.5)+1):
  ans=max(ans,i)
print(ans**2)

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

if math.sqrt(n).is_integer():
    print(n)
else:
    tmp = math.floor(math.sqrt(n))
    print(tmp*tmp)

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

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

Solution (Python):


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

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

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

Solution (Python):
import math
n = int(input())
while True:
    if math.sqrt(n) % 1 == 0:
        print(n)
        break
    n -= 1

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

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

ans = 1
while ans**2 <= N:
  ans += 1

print((ans-1)**2)

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

Solution (Python):
import sys
import math

input = sys.stdin.readline

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

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

Solution (Python):
import sys
import math
import bisect

def solve(n):
    return math.floor(math.sqrt(n)) ** 2

def main():
    n = int(input())
    print(solve(n))

if __name__ == "__main__":
    main()

Solution (Python):
n = int(input())
A = [int(x) for x in range(1,34000)]
for i in range(33999):
    A[i] = A[i]**2

B = [i for i in A if i <= n]

print(max(B))

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

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

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

ans = 0
for i in range(int(n ** 0.5) + 1):
    if i ** 2 <= n:
        ans = max(ans, i ** 2)

print(ans)

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

ans = 0
for i in range(int(pow(N,1/2))+1):
    if i**2 <=N:
        ans = i**2
print(ans)

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

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

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

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

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

Solution (Python):
import sys

def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))

def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _ in range(d1)]

def to_bin(x: int) -> str: return format(x, 'b') 
def to_oct(x: int) -> str: return format(x, 'o') 
def to_hex(x: int) -> str: return format(x, 'x') 
MOD=10**9+7
def divc(x,y) -> int: return -(-x//y)
def divf(x,y) -> int: return x//y
def gcd(x,y):
    while y: x,y = y,x%y
    return x
def lcm(x,y): return x*y//gcd(x,y)
def enumerate_divs(n):
    """Return a tuple list of divisor of n"""
    return [(i,n//i) for i in range(1,int(n**0.5)+1) if n%i==0]
def get_primes(MAX_NUM=10**3):
    """Return a list of prime numbers n or less"""
    is_prime = [True]*(MAX_NUM+1)
    is_prime[0] = is_prime[1] = False
    for i in range(2, int(MAX_NUM**0.5)+1):
        if not is_prime[i]: continue
        for j in range(i*2, MAX_NUM+1, i): is_prime[j] = False
    return [i for i in range(MAX_NUM+1) if is_prime[i]]
def prime_factor(n):
    """Return a list of prime factorization numbers of n"""
    res = []
    for i in range(2,int(n**0.5)+1):
        while n%i==0: res.append(i); n //= i
    if n != 1: res.append(n)
    return res

from itertools import accumulate as acc, combinations as combi, product, combinations_with_replacement as combi_dup
from collections import deque, Counter
from heapq import heapify, heappop, heappush
from bisect import bisect_left


def main():
    n = II()
    print(int(n**(1/2))**2)

if __name__ == '__main__':
    main()

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

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

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

for i in range(N, 0, -1):
  if (i ** (1/2)) % 1 == 0:
    print(i)
    exit()

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

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

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

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

Solution (Python):
import numpy as np


def main():
    n = int(input())
    while True:
        if int(np.sqrt(n)) == np.sqrt(n):
            print(n)
            exit()
        else:
            n = n-1


if __name__ == "__main__":
    main()

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

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

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

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

ans = 0

for i in range(10**5):
    if i ** 2 <= N:
        ans = i ** 2
        continue
    break

print(ans)

Solution (Python):

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi

N = ri()
print(floor(sqrt(N)) ** 2)

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

Solution (Python):
import math
n = int(input())
for i in range(n, 0, -1):
    if float.is_integer(math.sqrt(i)) == True:
        print(i)
        exit()

Solution (Python):
import math
n=int(input())
for i in range(n,0,-1):
  if math.sqrt(i)%1==0:
    print(i)
    exit()

Solution (Python):
import math

def resolve():
	n = int(input())
	for i in range(n, -1, -1):
		sr = math.sqrt(i)
		if sr - math.floor(sr) == 0:
			print(i)
			return
resolve()

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

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

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

print(ans)

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

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

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

Solution (Python):
import math

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

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

print(int(N**0.5)**2)

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

Solution (Python):
import math
n = int(input())
for i in reversed(range(n+1)):
    if round(math.sqrt(i))**2 == i:
        print(i)
        break

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

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

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

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

print(int(N**0.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):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()

for i in range(1, int(N**0.5 + 2)):
	if i**2 > N:
		print((i-1)**2)
		break

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()

for i in range(1, int(N**0.5 + 4)):
	if i**2 > N:
		print((i-1)**2)
		break

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()

for i in range(1, int(N**0.5 + 5)):
	if i**2 > N:
		print((i-1)**2)
		break

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()
for i in range(N, 0, -1):
	if sqrt(i) == int(sqrt(i)):
		print(i)
		exit()

Solution (Python):
import math
N=int(input())
if math.sqrt(N)%1==0:
    print(N)
else:
    x=int(math.sqrt(N))
    print(x**2)

Solution (Python):
N = int(input())
max_power = 0
for a in range(1, N + 1):
    if a**2 <= N:
        max_power = a**2
    else:
        break
print(max_power)

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

Solution (Python):
li =[]
for i in range(1000000):
    li.append(i**2)
N = int(input())
ans = []
for i in range(1000000):
    if li[i]<=N:
        ans.append(li[i])
print(max(ans))

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

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

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

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

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

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

for i in reversed(range(1,N+1)):
  if i**0.5==int(i**0.5):
    print(i)
    break

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

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

ans = 1
while True:
  if ans**2 > n:
    print((ans-1)**2)
    break
  else:
    ans += 1

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

Solution (Python):
N = int(input())
while N**0.5 % 1:
    N -= 1
print(N)

Solution (Python):
N=int(input())
while N:
    if N**0.5%1==0:print(N);break
    N-=1

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

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

Solution (Python):
N=int(input())
a=1
for i in range(int(10**4.6)):
    if i**2<=N:
        ans=max(a,i**2)
print(ans)

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

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

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

Solution (Python):
n=int(input())
l=[]
for i in range(int(n**0.5)+1):
  l.append(i**2)
print(max(l))

Solution (Python):
def intSqrt(n):
    x = 1
    while True:
        x2 = (x + n // x) // 2
        if x2 ** 2 <= n and abs(x - x2) <= 1:
            break
        x = x2
    return x2

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

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque

from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush


def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]



n=I()
for i in range(10**5):
    if i*i<=n:
        ans=i*i
print(ans)

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

ans=int(s)**2

print(int(ans))

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

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

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

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

Solution (Python):
import math

n = int(input())
a = int(math.sqrt(n))
print(a*a)

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

Solution (Python):
import math
n=int(input())
print(math.floor(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():
    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):
import math
N = int(input())
print(int(math.sqrt(N))**2)

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

Solution (Python):
N = int(input())
ans = 1
while ans * ans <= N:
    ans += 1

ans = (ans - 1) * (ans - 1)
print(ans)

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

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

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

            

if '__main__' == __name__:
    resolve()

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

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

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

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

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

Solution (Python):
n=int(input())
for i in reversed(range(n+1)):
  if (i**.5).is_integer():
    print(i)
    break

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

Solution (Python):
n = int(input())
l = []

for i in range(1,100000):
  l.append(i**2)

for i in range(len(l)):
  if l[i] > n:
    print(l[i-1])
    exit()

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

Solution (Python):
from math import sqrt

n = int(input())

for i in range(n, 0, -1):
    if int(sqrt(n)) ** 2 == i:
        print(i)
        exit()

Solution (Python):
import math

n = int(input())

k = n
ans = 0
while True:
  t = int(math.sqrt(k))
  if t**2==k:
    ans = k
    break
  k -= 1
print(ans)

Solution (Python):
import math

n = int(input())
i = n

while True:
    x = int(math.sqrt(i))
    if x ** 2 == i:
        ans = i
        break
    i -= 1
print(ans)

Solution (Python):
icase=0
if icase==0:
    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())
ans = 1
for i in range(n+1):
    if i**2 <= n:
        ans = i**2
    else:
        break
print(ans)

Solution (Python):
a=int(input())
k=1
for i in range(0,100000):
  if a<(k**2):
    break
  else:
    k+=1
print((k-1)**2)

Solution (Python):
a=int(input())
k=1
for i in range(0,100000):
  if a<(k**2):
    break
  else:
    k+=1
print((k-1)**2)

Solution (Python):
import math
n = int(input())
s = 1
for i in range(2, int(math.sqrt(n)) + 1):
    if i * i <= n:
        s = i * i
print(s)

Solution (Python):
N = int(input())
x = 0
while(1):
    if x*x > N:
        x -= 1
        break
    x += 1
        
print(x*x)

Solution (Python):

import io
import math

nim=int(input())
score=int(math.sqrt(nim))
result=score**2
print(result)

Solution (Python):



N = int(input())

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

Solution (Python):

n = int(input())
x = 1

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

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

for i in range(10 ** 5):
    if n == (i * i):
        print(i * i)
        exit()
    if n <= (i * i):
        break


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

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

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

ans = 0
for i in range(N + 1):
    if i * i > N:
        break
    ans = i
print(ans**2)

Solution (Python):
from sys import stdin
import math

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

Solution (Python):
N = int(input())
count = 1
while count ** 2 <= N:
    count += 1

print((count-1)**2)

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

for i in range(N,0,-1):
  x = math.sqrt(i)
  if x.is_integer():
    print(i)
    exit()

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

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

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

i = 1
while True:
    if i**2 <= N:
        i += 1
    else:
        i -= 1
        break

print(i**2)

Solution (Python):

n = int(input())
result = 1

for i in range(int(n ** (1 / 2) + 1)):
    result = max(result, i * i)

print(result)

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

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

n = n**(1/2)

print(int(n)**2)

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

Solution (Python):
N = int(input())
a = int((N+1)**0.5)
if a**2>N:
  ans = (a-1)**2
else:
  ans = a**2
print(ans)

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

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

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

tmp = int(N**0.5)**2

print(tmp)

Solution (Python):
n = int(input())
res = 0
for i in range(100000):
    if i * i <= n:
        res = i * i
    else:
        break

print(res)

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

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

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

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

Solution (Python):
import math
N=int(input())
F=float(N**0.5)
X=math.floor(F)
print(X**2)

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

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

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

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

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

    for i in reversed(range(1,n+1)):
        if (i ** 0.5).is_integer():
            print(i)
            exit()

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
res = 0
for i in range(100000):
    if i * i <= n:
        res = i * i
    else:
        break

print(res)

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

def heihou(n):
    a=int(n**0.5)
    if n==a**2:
        return True
    return False


for i in range(n):
    num=n-i
    if heihou(num):
        print(num)
        break

Solution (Python):
n = int(input())
num = 0
while True:
    if pow(num+1, 2)>n:
        break
    num += 1
ans = pow(num, 2)
print(ans)

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

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

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

Solution (Python):
import math
def solve(n):
    tmp = math.floor(math.sqrt(n))
    return tmp**2

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

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

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

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

Solution (Python):












mod = int(1e9+7)
INF = 1<<29
lINF = 1<<35

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

def main():
    n = int(input())
    x = int(n**0.5)**2
    print(x)
    return

if __name__=='__main__':
    main()

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

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

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

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

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

def resolve():
    N = int(input())

    print(int(N**0.5)**2)

if __name__ == '__main__':
    resolve()

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

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):
n = int(input())
print(int(n**0.5)**2)