#include <iostream>
#include <stdio.h>


using namespace std;

int nod(int a, int b)
{
	while ((a != 0) && (b != 0))
	{
		if (a > b)
			a = a-b;
		else b = b - a;
	}
	return (a);
}
int main()
{
	
	int n,a,b;
	cin >> n;
	int maxNod = 0;
	int maxA, maxB;
	b = n;
		for (int a = 1; a <= n/2; ++a)
		{
			
			b = n - a;
			if (nod(a, b) >= maxNod)
			{
				maxA = a;
				maxB = b;
				maxNod = nod(a, b);
			}

		}cout << maxA << " " << maxB;
		
	return 0;
}

const int primaries[] = {2,3,5,7,11,13,...};

for (int i = 1; i <= sizeof(primaries)/sizeof(it); ++i)

#include <iostream>
#include <stdio.h>

using namespace std;



int main()
{
	const int primaries[] = { 2, 3, 5, 7, 11, 13,...};
	int n;
	cin >> n;
	if (n <= 1)
	{
		cout << "WTF?"
			return 1;
	}
	for (int i = 1; i <= sizeof(primaries) / sizeof(int); ++i)
	{
		if (n % primaries[i] == 0)
		{
			int a = n / primaries[i];
			cout << a << " " << n - a;
			break;
		}
	}
	return 0;
}

#include <iostream>
#include <stdio.h>

using namespace std;



int main()
{
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
	const long long int primaries[] = {2, 3, 5, 7, 11, 13,17,22,23};
	long long int n;
	cin >> n;
	
	for (long long int i = 0; i <= sizeof(primaries) / sizeof(long long int); ++i)
	{
		if (n % primaries[i] == 0)
		{
			long long int a = n / primaries[i];
			cout << n-a << " " << a;
			break;
		}
	}
	
	return 0;
}