\documentclass[11pt]{scrartcl}
\usepackage{evan}

\begin{document}
\title{Brazil 2019/J5}
\subtitle{Evan Chen}
\author{Twitch Solves ISL}
\date{Episode 134}
\maketitle

\section*{Problem}
The left figure below shows one white square enclosed by four black squares,
while the right figure shows three white squares enclosed by seven black squares.
\begin{center}
\begin{asy}
  unitsize(0.6cm);
  draw((5,2)--(6,2)--(6,1), grey);
  fill(shift(-2,1)*unitsquare);
  fill(shift(-1,0)*unitsquare);
  fill(shift( 0,1)*unitsquare);
  fill(shift(-1,2)*unitsquare);
  fill(shift(4,1)*unitsquare);
  fill(shift(4,2)*unitsquare);
  fill(shift(5,0)*unitsquare);
  fill(shift(6,0)*unitsquare);
  fill(shift(5,3)*unitsquare);
  fill(shift(6,2)*unitsquare);
  fill(shift(7,1)*unitsquare);
\end{asy}
\end{center}
For $n \ge 1$, what is the maximum number of white squares
that can be enclosed by $n$ black squares?

\section*{Video}
\href{https://www.youtube.com/watch?v=hU0Zv1-UTH8&list=PLi6h8GM1FA6yHh4gDk_ZYezmncU1EJUmZ}{\texttt{https://youtu.be/hU0Zv1-UTH8}}

\section*{External Link}
\url{https://aops.com/community/p13532156}

\newpage

\section*{Solution}
We didn't write this one up because it was way too many cases and details to consider.
You have to watch the video for an outline of the solution.

\end{document}
