//Ian Gavlick
//Problem Solving
//problem025
//ant on a chess board

#include<iostream>
#include<cmath>

using namespace std;

int main(){
  int n;
  while(cin >> n){
    int r, c, p;
    bool done = false;
    int a = (int)sqrt(n);
    if(a*a == n){//no remainder
      if(a%2 == 0){
	c = a;
	r = 1;
      }
      else{
	c = 1;
	r = a;
      }
    }
    else{
      if(a%2 == 0){//up then left
	c = a+1;
	r = 1;
	p = a*a + 1;
	for(int i=0; i<a; i++){
	  if(p == n) done = true;
	  if (done) break;
	  r++;
	  p++;
	}
	for(int i=0; i<a; i++){
	  if(p == n) done = true;
	  if (done) break;
	  c--;
	  p++;
	}	
      }
      else{//right then down
	c = 1;
	r = a+1;
	p = a*a + 1;
	for(int i=0; i<a; i++){
	  if(p == n) done = true;
	  if (done) break;
	  c++;
	  p++;

	}
	for(int i=0; i<a; i++){
	  if(p == n) done = true;
	  if (done) break;
	  r--;
	  p++;
	}	
      }
    }
    cout << c << " " << r << endl;
  }
  return 0;
}