def insert(line, ind, s):
line = line[:ind] + s + line[ind:]
return line
size = int(input())
phoneNum = input()
i = size - 2 if size % 2 == 0 else size - 3
for i in range(i, 0, - 2):
phoneNum = insert(phoneNum, i, '-')
print(phoneNum)#include<bits/stdc++.h>
#define lol ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#define el "\n"
#define ll long long
#define MOD 1000000007
#define ld long double
using namespace std;
//INSANE
int main()
{
lol
int n; cin>>n;
string s; cin>>s;
if(n==2||n==3)
{
cout<<s;
}
else if(n%2==0)
{
for(int i=0;i<n;i++)
{
cout<<s[i];
if(i%2==1&&i!=n-1)
{
cout<<'-';
}
}
}
else if(n%3==0)
{
for(int i=0;i<n;i++)
{
cout<<s[i];
if(i%3==2&&i!=n-1)
{
cout<<'-';
}
}
}
else
{
for(int i=0;i<n;i++)
{
cout<<s[i];
if(i%3==1&&i!=n-1)
{
cout<<'-';
}
}
}
cout<<el;
}
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |