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

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

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

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

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

Solution (Python):
import math


def answer(n: int) -> int:
    return int(math.sqrt(n)) ** 2


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


if __name__ == '__main__':
    main()

Solution (Python):
import math
x=int(input())
y= math.sqrt(x)
z= y//1
a=z**2
print(int(a))

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

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

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

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

Solution (Python):
def multiple(n):
    a = []
    for i in range(1,int(n**.5)+1):
        a.append(i*i)
    return a
n = int(input())
a = multiple(n)
ans = 10**18
for i in a:
    if n-i < 0:
        continue
    ans = min(ans,abs(n-i))
print(n-ans)

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

Solution (Python):
def multiple(n):
    a = []
    for i in range(1,int(n**.5)+1):
        a.append(i*i)
    return a
n = int(input())
a = multiple(n)
ans = 10**18
for i in a:
    if n-i < 0:
        continue
    ans = min(ans,abs(n-i))
print(n-ans)

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

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

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

Solution (Python):
import math

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

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

Solution (Python):
import math

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

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

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

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

ans=1
loop = 3
for i in range (1,100000):
        if i**2 <= n:
                ans=i**2
        
        

print(ans)

Solution (Python):
n = int(input())
p = int(n**0.5)
a = 1
ans = 1
while a<=p:
    if a**2 <=n:
        ans = max(ans,a**2)
    a +=1
print(ans)

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

Solution (Python):
N = int(input())
from math import sqrt, floor
for i in range(1,floor(sqrt(N))+2):
    if i**2 > N:
        print((i-1)**2)

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

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

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

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

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

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

ans = 1
for i in range(1,math.floor(math.sqrt(N))+1):
  if i * i <= N:
    ans = i * i
    
print(ans)

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

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

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

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

Solution (Python):
def main():
    N = int(input())
    a = 1
    i = 0
    prev = 0
    while a <= N:
        i += 1
        prev = a
        if a > N:
            break
        else:
            a = i * i
    print(prev) 
main()

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

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


if __name__ == "__main__":
    main()

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

for i in range(1, 10**9):
  if i**2 == N:
    print(i**2)
    break
  elif i**2 > N:
    print((i-1)**2)
    break

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

ans = 0
for i in range(1, 10 ** 5):
    if i ** 2 <= n:
        ans = i ** 2

print(ans)

Solution (Python):

n = int(input())
while n>0:
    tmp = n**(1/2)
    if(tmp==int(tmp)):
        print(n)
        break
    n-=1

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


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


print(ans)

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

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

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    N = int(readline())

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


if __name__ == '__main__':
    main()

Solution (Python):
import sys



def input():
    return sys.stdin.readline().strip()


def input_int():
    return int(input())


def input_int_list():
    return [int(i) for i in input().split()]


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


if __name__ == "__main__":
    main()

Solution (Python):
from math import sqrt

n = int(input())

ans = int(sqrt(n))

if (ans + 1) * (ans + 1) <= n:
    print((ans + 1) * (ans + 1))
elif ans * ans <= n:
    print(ans * ans)
else:
    print((ans - 1) * (ans - 1))

Solution (Python):
from math import sqrt

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

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

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):
import math

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

print(n)

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

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

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

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

Solution (Python):
N=int(input())
C=0
if N==1:
  print(1)
  exit()
for i in range(1,N):
  if i**2<N:
    C=i**2
  elif i**2==N:
    C=i**2
    break
  elif i**2>N:
    break
print(C)

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

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

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

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

Solution (Python):
n = int(input())
while (n ** 0.5) % 1 != 0:
    n -= 1
print(n)

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

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

from math import floor, sqrt
ans = floor(sqrt(N))**2
print(ans)

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

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

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

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

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

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

Solution (Python):
import sys
N=int(input())
if N==1:
    print("1")
elif N==2:
    print("1")
else:
    for i in range(N):
        if i**2>N:
            print((i-1)**2)
            sys.exit()
        else:
            pass

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

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

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

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

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

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

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

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

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

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

for i in range(1, 10**5):
    p = i**2
    if p > n:
        print((i-1)**2)
        break

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

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

Solution (Python):
from math import sqrt

n = int(input())

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

Solution (Python):

N = int(input())

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

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

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

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

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

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

Solution (Python):
from math import sqrt
n=int(input())
for i in range(1,int(sqrt(n))+1):
  if i**2>n:
    print((i-1)**2)
    break
else:
  print(i**2)

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    N = int(readline())
    ans = int(N ** 0.5) ** 2
    print(ans)


if __name__ == '__main__':
    main()

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

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

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

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

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

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

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

n = ri()
a = int(n**0.5)
print(a**2)

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

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

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

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

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()


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

if __name__ == "__main__":
    main()

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

Solution (Python):









n = int(input())

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

Solution (Python):
N=int(input())
if int((N+1)**.5)**2==N:print(N)
else:print(int(N**.5)**2)

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

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

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

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

Solution (Python):
k,n = 0,int(raw_input())

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

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

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

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

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

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

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

Solution (Python):
N=int(input())
print((int(N**(1/2)))**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())
for x in range(10**5):
  if x**2>n:
    print((x-1)**2)
    break

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

Solution (Python):
n = int(input())
cnt = 1
ans = 0
while 1:
    tmp = cnt ** 2
    if tmp <= n:
        ans = tmp
        cnt += 1
    else:
        break

print(ans)

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
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
import numpy as np
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

import math
N = INT()
m = int(math.sqrt(N))
print(m ** 2)

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

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

print(ans)

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    N = int(readline())

    n = 1
    while (n + 1) * (n + 1) <= N:
        n += 1

    print(n * n)

    return


if __name__ == '__main__':
    main()

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

Solution (Python):
import math

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

Solution (Python):
n = int(input())
 
a = 1
b = 0
c = 0

 
while c <= n:
  b = c
  c = a ** 2
  a += 1
  
print(b)

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

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

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

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

if __name__ == "__main__":
    n = int(input())
    print(int(n**0.5)**2)

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

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

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

Solution (Python):
def isSquare(x):
  return x == round(x**(1/2))**2

N = int(input())
f = N
while True:
  if isSquare(f):
    print(f)
    exit()
  else:
    f -= 1

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

Solution (Python):
def solve():
    N = int(input())
    for i in range(N, 0, -1):
        if (i ** 0.5).is_integer():
            print(i)
            exit()


if __name__ == "__main__":
    solve()

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
N = I()
ans = 0
for i in range(31625):
    if i*i > N:
        break
    else:
        ans = i*i
print(ans)

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

Solution (Python):
N = int(input())
res = 0
for i in range(32000):
  if i*i > N:
    res = (i-1)*(i-1)
    break
print(res)

Solution (Python):
import math

N = int(input())

for n in range(N):
    num = N - n
    sqrt_num = math.sqrt(num)
    
    if (int(sqrt_num) == sqrt_num):
        print(num)
        break

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

import math
n_sqrt = math.floor(math.sqrt(N))
print(n_sqrt ** 2)

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

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

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

while True:
  if math.sqrt(N).is_integer():
    print(N)
    break
  N-=1

Solution (Python):
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

N = int(input())


def ans():
    for i in range(100000):
        if i * i > N:
            return (i - 1) * (i -1)


print(ans())

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

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

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

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

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

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

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

for i in range(n + 1):
    if (i + 1) ** 2 > n:
        break
print(i ** 2)

Solution (Python):
import bisect
n = int(input())
li = []
for i in range(100000):
    li.append(i**2)
a = bisect.bisect_right(li, n)
print(li[a-1])

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

Solution (Python):
n = int(input())
c=[]
for i in range(n+1):
  a = i**2
  if a <= n:
    c.append(a)
  else:
    break
print(max(c))

Solution (Python):
s = input()

n = int(s)

answer = []

x = 1
answer.append(x)

while (x * x <= n):
    x += 1
    answer.append(x * x)

p = answer.pop()
if p == 1:
    print(p)
else:
    ans = answer.pop()
    print(ans)

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

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(4100000)
import math
INF = 10**9

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

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


if __name__ == '__main__':
    main()

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

Solution (Python):
import sys, os, math, bisect, itertools, collections, heapq, queue

from decimal import Decimal
from collections import defaultdict, deque

sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = ii()

    ret = 0
    for n in range(int(N ** 0.5) + 1):
        if n * n <= N:
            ret = max(ret, n * n)
    print(ret)


if __name__ == '__main__':
    main()

Solution (Python):
def actual(N):
    for i in range(N, 0, -1):
        is_square_number = (i ** 0.5) % 1 == 0

        if is_square_number:
            return i

N = int(input())
print(actual(N))

Solution (Python):
def actual(N):
    for i in range(1, 10 ** 9 + 1):
        if i ** 2 > N:
            return (i - 1) ** 2

N = int(input())
print(actual(N))

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

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

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

print((i - 1) ** 2)

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

Solution (Python):

N = int(input())
sq = (int(N**(1/2))**2)
print(sq)

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

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

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

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

print(ans)

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

Solution (Python):
N = int(input())
c = 0
ans = 1

while (c+1)**2<=N:
  ans = (c+1)**2
  c+=1
  
print(ans)

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

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

i = 1
while True:
    t = i*i
    if t == n:
        print(t)
        exit()
    elif t > n:
        print((i-1)*(i-1))
        exit()
    
    i += 1

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

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

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

Solution (Python):


N = int(input())

ans = 1
i = 1

while True:
    ans = i ** 2
    i += 1
    if i ** 2 > N:
        break

print(ans)

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

print((i-1)**2)

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

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

Solution (Python):
import math

n = int(input())

while True:
  x = math.sqrt(n)
  
  if x.is_integer():
    print(n)
    exit()
  n -= 1

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

Solution (Python):










import sys

def input(): return sys.stdin.readline().rstrip()
def iIn(): return int(input())
def iInM(): return map(int, input().split())
def iInM1(): return map(int1, input().split())
def iInLH(): return list(map(int, input().split()))
def iInLH1(): return list(map(int1, input().split()))
def iInLV(n): return [iIn() for _ in range(n)]
def iInLV1(n): return [iIn()-1 for _ in range(n)]
def iInLD(n): return [iInLH() for _ in range(n)]
def iInLD1(n): return [iInLH1() for _ in range(n)]
def sInLH(): return list(input().split())
def sInLV(n): return [input().rstrip('\n') for _ in range(n)]
def sInLD(n): return [sInLH() for _ in range(n)]

def OutH(lst, deli=' '): print(deli.join(map(str, lst)))
def OutV(lst): print('\n'.join(map(str, lst)))

sys.setrecursionlimit(10 ** 6)

int1 = lambda x: int(x) - 1

INF = int(1e9)
MOD = 1000000007
dx = (-1, 0, 1, 0)
dy = (0, -1, 0, 1)


N = iIn()

n = 1
while 1:
  if n**2 > N:
    print((n-1)**2)
    exit()
  else:
    n += 1

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

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

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

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

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

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

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

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

if not ( 1 <= N <= 10 ** 9 ):
    sys.exit

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

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

Solution (Python):
import math
def main():
  n = int(input())
  for i in reversed(range(1,n+1)):
    if math.sqrt(i) %1==0:
      print(i)
      break;
main()

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

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

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

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

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

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

Solution (Python):
import math
N = int(input())
N_square_root = math.floor(math.sqrt(N))
result = 0
for i in range(N_square_root + 1):
    result = i * i
print(result)

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

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

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

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

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

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

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

Solution (Python):
def mi():
    return map(int, input().split())

def ii():
    return int(input())

def main():
    N = ii()
    print(int(N**0.5)**2)

if __name__ == '__main__':
    main()

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

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

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())
ans = 1
for i in range(10**5):
    if i**2 <= N:
        ans = i**2
    if i**2 > N:
        break

print(ans)

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

for i in range(1, int(a ** .5)+2):
  if i ** 2 > a:
    print((i-1)**2)

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

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

Solution (Python):
N = int(input())
if N == 1:
  print(1)
  quit()

pre = 0
for i in range(1, N+1):
  n = i**2
  if n > N:
    print(pre)
    quit()
  
  pre = n

Solution (Python):
N = int(input())
answer = 0
for x in range(1, 100000):
  if x ** 2 <= N:
    answer = x ** 2
  else:
    break
print(answer)

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

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

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

Solution (Python):
import sys

input = sys.stdin.readline


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

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

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
from math import sqrt
N=int(input())
x=int(sqrt(N))
if (x+1)**2<=N:
    print((x+1)**2)
else:
    print(x**2)

Solution (Python):
if __name__ == '__main__':
    n =int(input())
    max = 1
    for i in range(1,n):
        now = i*i
        if now > n:
            break
        max = now
    print(max)

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

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

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

Solution (Python):
import math

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

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

for i in reversed(range(N)):
    n = math.sqrt(N)
    if n.is_integer():
        print(int(n ** 2))
        exit()
    N -= 1

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

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

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

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

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

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

ans = 0
for n in range(N+1):
    if n*n <= N: ans = n*n
    else: break
print(ans)

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

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

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

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

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

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

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

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