#include<stdio.h>
#include<stdlib.h>
#include<math.h>
main(){
   //給出一個整數分解成盡可能多的連續整數的和 
  int  n=0,m,r;
  int i=0,j=0;
  int count=1,sum=0,max=1,little=1;
  
  scanf("%d",&n);
  //r=sqrt(n+1);
  
  if(n>=0){i=1;m=n;}
  else {i=n;
       m=0;
  }

  for(;i<=m;i++){
	  sum=0;
	  count=0;
	  for(j=i;j<=m;j++){
		  sum+=j;
		  count++;
		  
		  if((sum==n)&&(count>=max)){
			   max=count;
			   little=i;
		  }
		 
		  if((n>0&&sum>n)||(n<0&&sum<n))
             break;
		  
	  }
  }

  printf("\nlittle=%d  the max count=%d\n",little,max);
  
  i=1;
  j=little;
   
  printf("%d",j);
  i++;
  while(i<=max){
	j++;
    printf("+%d",j);
    
	i++;
  }
  
  printf("=%d\n",n);
}