/*
 * @(#) msp97_z.c - Problem 'Z' ("Number grouping") solution
 * of the MSU Personal Programming Contest in 1997.
 * (c) 1998 Ivan Maidanski <ivmai@chat.ru> http://ivmai.chat.ru
 * Freeware program source. All rights reserved.
 **
 * Language: ANSI C
 * Tested with: Borland C++ v3.1
 * Last modified: 1998-09-26 18:45:00 GMT+04:00
 */

/* Input data file: a.in */

#include <stdio.h> /* FILE, EOF, fopen(), fscanf(), printf() */

int a[100],t[100];

int main()
{
 int i,j,n;
 int vx;
 long v;
 FILE *f=fopen("a.in","rt");
 if (fscanf(f,"%*[^0-9]%d",&n)==EOF || !n || n&1)
  return 1;
 for (i=0;i<n;i++)
  if (fscanf(f,"%*[^-0-9]%d",&a[i])==EOF)
   return 1;
 for (i=1,v=vx=(a[0]>=0? a[0] : -a[0]);i<n;i++)
  if (v>(j=a[i]>=0? a[i] : -a[i]))
   v=j;
   else if (vx<j)
    vx=j;
 v*=vx;
 for (i=0;i<n;i++)
  t[i]=1;
 for (i=0;i<n-1;i++)
  if (t[i])
  {
   for (j=i+1;j<n;j++)
    if (t[j] && (long)a[i]*a[j]==v)
    {
     t[j]=0;
     break;
    }
   if (j==n)
   {
    v=-v;
    break;
   }
  }
 for (i=0;i<n;i++)
  t[i]=1;
 for (i=0;i<n-1;i++)
  if (t[i])
  {
   for (j=i+1;j<n;j++)
    if (t[j] && (long)a[i]*a[j]==v)
    {
     t[j]=0;
     printf("%d %d\n",a[i],a[j]);
     break;
    }
  }
 return 0;
}