#include <stdio.h>     // Mathmatical Solution 
long long a;
int main(){
	scanf("%lld",&a);
	printf("%lld %lld\n",(a-1)*(a-1)/2+1,(a+1)*(a+1)/2-1);
}

#include<stdio.h>
int b[1010],d[1010],p;
main()
{
    int n,m,i;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
        scanf("%d",&b[i]);  
    for(p=i=1;p<n&&i<=m;i++)
    {
        scanf("%d",&d[i]);
        p+=d[i]+b[p+d[i]];
    }
    printf("%d",i-1);
}

#include<stdio.h>
int n, m, a, b, visit[501], g[501][501], i, j, cnt;
main()
{
	scanf("%d%d",&n,&m);
	for(i=1; i<=m; i++)
	{
		scanf("%d%d",&a,&b);
		g[a][b]=1;
		g[b][a]=1;
	}
	for(i=2; i<=n; i++)
		if(g[1][i])
		{
			visit[i]=1;
			for(j=1; j<=n; j++)
			{
				if(j==i) continue;
				if(g[i][j]) visit[j]=1;
			}
		}
	for(i=2; i<=n; i++)
		if(visit[i]) cnt++;
	printf("%d",cnt);
}
	

#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <queue>
using namespace std;

//#define _TEST

#ifdef _TEST
#include "windows.h"
#include "conio.h"
#endif //_TEST

struct _Node
{
	int nIdx;
	int nDepth;
};

const static int N_MAX	= 601;
int n, m;

queue<_Node> q;
vector<int> vecMap[N_MAX];
vector<int> vecVisitor;

int nHashInvited[N_MAX];

int main(int argc, char **argv)
{
#ifdef _TEST
	freopen("input.txt", "r", stdin);
#endif // _TEST
	int nCnt = 0;

	scanf("%d %d", &n, &m);
#ifdef _TEST
	int t = GetTickCount();
#endif // _TEST

	for ( int i = 0 ; i < m ; ++i )
	{
		int nFrom, nTo;
		scanf("%d %d", &nFrom, &nTo );
		vecMap[nFrom].push_back( nTo );
		vecMap[nTo].push_back( nFrom );
	}
	_Node stNode;
	stNode.nIdx = 1;
	stNode.nDepth = 0;
	
	_Node stNodeTemp;
	q.push( stNode );
	while ( !q.empty() )
	{
		_Node stNodeTemp = q.front();
		q.pop();

		nHashInvited[ stNodeTemp.nIdx ] = 1;

		if ( stNodeTemp.nDepth >= 2 )
			continue;

		for ( int i = 0 ; i < vecMap[ stNodeTemp.nIdx ].size() ; ++i )
		{
			_Node stNodeBranch;
			stNodeBranch.nIdx = vecMap[ stNodeTemp.nIdx ].at(i);
			stNodeBranch.nDepth = stNodeTemp.nDepth + 1;

			if ( nHashInvited[ stNodeBranch.nIdx ] == 0 )
				q.push( stNodeBranch );	
		}
	}
	
	for ( int i = 0 ; i < N_MAX ; ++i )
		if ( nHashInvited[i] == 1)
			++nCnt;
	printf("%d\n", nCnt - 1 );

#ifdef _TEST
	printf("\tRunTime = %d\n", GetTickCount() - t );
	getch();
#endif // _TEST
	return 0;
}

#include<stdio.h>     // using set
#include<set>
using namespace std;
int i,n,k;
int d[15];
bool check[15];
set<int> numbers;
void aa(int su,int lev)
{
	int i;
	if(lev==k){
		numbers.insert(su);
		return;
	}
	for(i=0;i<n;i++){
		if(check[i])continue;
		check[i]=true;
		if(d[i]<10)aa(su*10+d[i],lev+1);
		else aa(su*100+d[i],lev+1);
		check[i]=false;
	}
}
int main()
{
	scanf("%d%d",&n,&k);
	for(i=0;i<n;i++)scanf("%d",d+i);
	aa(0,0);
	printf("%d",numbers.size());
	return 0;
}

#include <iostream>
#include <string>
#include <set>		//using set and string
using namespace std;

int N,K,C[11]; string NUM[11]; set<string> S;

void go(int a, string s)
{
	if (a == K) S.insert(s);
	else{
		int i;

		for (i=0;i<N;i++) if (!C[i]){
			C[i] = 1; go(a+1,s+NUM[i]); C[i] = 0;
		}
	}
}

int main()
{
	int i;

	cin >> N >> K;
	for (i=0;i<N;i++) cin >> NUM[i];

	go(0,"");

	cout << S.size();

	return 0;
}